Adam Sampson's sorting bookmarkshttps://bookmarks.offog.org/ats/sortingAdam Sampson2018-01-06T23:19:43Zp1v0t/Sort: Implementation of some of comparison based sorting algorithmshttps://bookmarks.offog.org/edit?url=https%3A%2F%2Fgithub.com%2Fp1v0t%2FSort2018-01-06T23:19:43Z... in the style of qsort.Proving that Android’s, Java’s and Python’s sorting algorithm is broken (and showing how to fix it) | Envisage: Engineering Virtualized Serviceshttps://bookmarks.offog.org/edit?url=http%3A%2F%2Fenvisage-project.eu%2Fproving-android-java-and-python-sorting-algorithm-is-broken-and-how-to-fix-it%2F2015-03-14T14:26:44ZUsing formal methods to find a pretty serious bug.Bertrand Meyer's technology+ blog » Blog Archive » Lampsorthttps://bookmarks.offog.org/edit?url=https%3A%2F%2Fbertrandmeyer.com%2F2014%2F12%2F07%2Flampsort%2F2015-01-18T01:10:03Z"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*).Source codehttps://bookmarks.offog.org/edit?url=http%3A%2F%2Fwww.cs.dartmouth.edu%2F%7Edoug%2Fsource.html2012-10-17T11:54:53ZVarious 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.gmane.comp.java.openjdk.core-libs.develhttps://bookmarks.offog.org/edit?url=http%3A%2F%2Fpermalink.gmane.org%2Fgmane.comp.java.openjdk.core-libs.devel%2F26282009-09-13T20:09:25ZTwo-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?