TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Exploring the Worst Case Complexity of Quicksort (2015)

20 pointsby 10000100001010over 6 years ago

4 comments

DannyBeeover 6 years ago
I wonder if the author is aware of antiqsort<p><a href="https:&#x2F;&#x2F;www.cs.dartmouth.edu&#x2F;~doug&#x2F;aqsort.c" rel="nofollow">https:&#x2F;&#x2F;www.cs.dartmouth.edu&#x2F;~doug&#x2F;aqsort.c</a> and <a href="https:&#x2F;&#x2F;github.com&#x2F;matslina&#x2F;qsort&#x2F;blob&#x2F;master&#x2F;antiqsort.c" rel="nofollow">https:&#x2F;&#x2F;github.com&#x2F;matslina&#x2F;qsort&#x2F;blob&#x2F;master&#x2F;antiqsort.c</a> ...
betterunix2over 6 years ago
The textbook solution is to use this pivot selection algorithm:<p><a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Median_of_medians" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Median_of_medians</a><p>In practice it is not really worth it.
评论 #17946420 未加载
PretzelFischover 6 years ago
The light grey text with the white background, seems to be a popular design choice. But I have trouble reading this page do to the lack of contrast.
dangoljamesover 6 years ago
This was just as ridiculously nerdy as it was when friends of mine from school and I did it in 1981 -- in basic on the trs80 though :D
评论 #17946278 未加载