Games Theoreticians Play
Prove that an algorithm is ?(f(n)) by nature
- e.g., sorting using only comparisons cannot be done in less than n log n
What’s wrong with this claim?
“I wrote a FindMin() operation that runs in in O(log n) time on an unsorted list of integers!”