Question. Larry has developed an algorithm that sorts an array, and his analysis concludes that it takes O(n0.95log2(n)) time to sort an array of n numbers. Show that either Larry's algorithm does not work or that his analysis is wrong.
Answer. That is not enough time to look at each item in the array once. Changing an item that was not looked at can change the answer, so the answer cannot be guaranteed to be correct.