Comment by imtringued

5 years ago

People complain about Big-O once they reach the end of its usefulness. Your algorithm is O(n) or O(n log n) but it is still too slow.

0 comments