R. Clayton (rclayton@monmouth.edu)
(no date)
I've updated *main.o:
1 I've included my faster solution to assignment 7; use -t to see it. The
faster code is asymptotically faster than the slower code. If your current
code is about as fast as the slow code, you can't possible hope to tweak it
to make it as fast as the fast one; you'll have to discover a new, faster
algorithm.
2 I've added some code to generate smaller problems: up to 4 green and yellow
points each on a 11x11 field. I found using smaller problems a much easer
way to test my code. Give the -l command-line option to use it.
3 The test code compares the answers generated by the slow and fast code and
explodes with an internal error if they're different. The fast code is
significantly different from the slow code; although possible, it is
unlikely that the same error occurs in both places. If the test code
reports an error in the computed answer, chances are it's in your code and
not mine (although you never know).
This archive was generated by hypermail 2.0b3 on Fri May 09 2003 - 15:30:05 EDT