Sort algorithms home	Java C FORTRAN PASCAL
sort simple sort In-place sort quicksort balanced quicksort introspective sort insertion sort selection sort diminishing increment sort shell sort heapsort adaptive heap sort introspective sort adaptive sort adaptive heap sort distribution sort bin sort range sort counting sort histogram sort merge sort	balanced quicksort Also defined at: http://www.nist.gov/dads/HTML/balancedqsrt.html. Inherits from quicksort A variant of quicksort which attempts to choose a pivot likely to represent the middle of the values to be sorted. [National Institute of Standards and Technology]

Author: Nikita Ogievetsky, © Cogitech, Inc. 2002