Tasty » Adam Sampson's sorting bookmarks

p1v0t/Sort: Implementation of some of comparison based sorting algorithms edit / delete

... in the style of qsort.

to algorithms cmp201 sorting ... on 06 January 2018

Proving that Android’s, Java’s and Python’s sorting algorithm is broken (and showing how to fix it) | Envisage: Engineering Virtualized Services edit / delete

Using formal methods to find a pretty serious bug.

to correctness formal-methods java python sorting verification ... on 14 March 2015

Bertrand Meyer's technology+ blog » Blog Archive » Lampsort edit / delete

"Leslie Lamport likes to use the example of non-recursive Quicksort. Independently of the methodological arguments, his version of the algorithm should be better known." This is a nice bit of proper computer science: the basic idea is to describe Quicksort in terms of sets of objects that have yet to be sorted (i.e. sort of the same way you usually describe pathfinding algorithms like A*).

to algorithms cs sorting teaching ... on 18 January 2015

Source code edit / delete

Various neat (and mostly short) bits of code from one of the Plan 9 contributors. antiquicksort -- which automatically derives worst-case input for Quicksort implementations -- is pretty neat.

to algorithm map software sorting wordplay ... on 17 October 2012

gmane.comp.java.openjdk.core-libs.devel edit / delete

Two-pivot quicksort. Can this be generalised to N-pivot quicksort (yes), and where's the optimum point for the tradeoff between recursion cost and wrangling pivots?

to algorithm cs quicksort sorting ... on 13 September 2009