4 ms·
I mean this thing from the article: https://briangordon.github.io/images/worstcase.svg https://briangordon.github.io/images/worstcase.svg > n queries taking l
by brianpgordon 12y ago
I mean this thing from the article:
https://briangordon.github.io/images/worstcase.svg https://briangordon.github.io/images/worstcase.svg
> n queries taking log(n) + n time each is O(n log n)
No, it's O(n^2).
- michaelmior 12y agoWow, clearly commenting too late. Of course you're right :)