exercises

exercises copied to clipboard

Example "sort sorts better than n^2" doesn't actually verify the algorithm's time complexity

1

Someone not familiar with time complexity might see that this spec is passing and assume that their algorithm is less than O(n^2), when in fact the algorithm might be O(n^2)...

davidrunger