R. Clayton (rclayton@monmouth.edu)
(no date)
What Big O() is acceptable for this programming assignment for a good grade?
eg. O(n^2) or O(n^3)?
The smallest one you can find. My solution is currently O(n^3) and I should be
able to reduce that to O(n^2 log n) when I get a spare hour or two. Off in the
hazy distance I think I see an O(n^2) algorithm, but I'm not sure.
This archive was generated by hypermail 2.0b3 on Fri May 10 2002 - 12:45:04 EDT