From Wikipedia, the free encyclopedia

Correction

This article mentions the algorithm has 'constant-time performance' which implies O(1). This is not correct.

Later the article mentions the Algorithm has a complexity of O(N log(N)). 209.171.85.105 ( talk) 13:22, 24 March 2024 (UTC) reply

Since there have been no objections, I will make this correction myself. 104.158.166.216 ( talk) 23:12, 28 March 2024 (UTC) reply
From Wikipedia, the free encyclopedia

Correction

This article mentions the algorithm has 'constant-time performance' which implies O(1). This is not correct.

Later the article mentions the Algorithm has a complexity of O(N log(N)). 209.171.85.105 ( talk) 13:22, 24 March 2024 (UTC) reply

Since there have been no objections, I will make this correction myself. 104.158.166.216 ( talk) 23:12, 28 March 2024 (UTC) reply

Videos

Youtube | Vimeo | Bing

Websites

Google | Yahoo | Bing

Encyclopedia

Google | Yahoo | Bing

Facebook