R. Clayton (rclayton@clayton.cs.monmouth.edu)
(no date)
I am planning to use the STL permutation algorithms for assignment 5. Where
can I get more information on them?
You can find information in Musser, Derge, and Siani; you can also check out
the on-line information given in the links section of the class home page.
I should warn you that your program must run in reasonable time. I haven't
figured out exactly what "reasonable" means (I think there's an O(n^2)
solution, but I haven't had the time to check). However, whatever "reasonable"
turns out to be, it will definitely not be "generate every possible answer and
check each one", which I'm guessing is the direction in which you're heading.
This archive was generated by hypermail 2.0b3 on Fri May 10 2002 - 12:45:04 EDT