Wikipedia:Featured article candidates/Quicksort

From Wikipedia, the free encyclopedia

[edit] Quicksort

This article used to be quite contentious and full of cruft like an excessive number of implementations, but I think it's matured well and has a lot of good content now. I added a hopefully-illustrative diagram, and its treatment of optimizations of the algorithm is particularly thorough. It has some references, although more wouldn't hurt. Deco 00:26, 25 May 2005 (UTC)

Comment: the pseudocode example is needlessly complicated. I would recommend replacing it with something more along the lines of the Haskell and Ruby implementations. Fredrik | talk 02:07, 25 May 2005 (UTC)

Thanks for the feedback. For some reason this never occurred to me. I've tried to deal with this by presenting a separate simpler version first, then having a separate section for the other version, because it's so common. Deco 02:48, 25 May 2005 (UTC)

Hmm, I just realised, this article contains no formal analysis of quicksort's resource use whatsoever. I'm going to withdraw this nomination until another time if that's okay. Deco 03:44, 25 May 2005 (UTC)