Big-O notation has been drilled into us since our first data structures class. O(1) good.O(n) acceptable.O(n log n) fine.O(n²) bad. We memorize it for interviews, use it to compare algorithms, and treat it as the final word on performance. But once y...

Markdown supported · ⌘↵ to post
No responses yet.