January 27, 2006
Time bounSyllabus for all sect
I know two people who have finished reasonable implementations of project 1. Based on those datapoints we are going to increment the running time bound to 10 seconds on the Dijkstra scissors.
The idea is that a resonable implementation that uses good data structures and algorithm decisions should easily make the time bound while implementations that include poor choices should not. If you are down to optimizing machine code and binary data structures then talk to me.
Posted by jones at January 27, 2006 02:08 PM
Post a comment
Thanks for signing in, . Now you can comment. (sign out)(If you haven't left a comment here before, you may need to be approved by the site owner before your comment will appear. Until then, it won't appear on the entry. Thanks for waiting.)