This is a small collection of sort algorithms.
This is the SourceForge.net short project description page for Burstsort, a sorting algorithm developed by Stefan Webb. Best suitable for short strings in large datasets. There is also a new C++ implementation, the Burstsort 2.0 Library with UTF-8 support.
This is lecture material by H. W. Lang about Quicksort, also known as "Q sort" or "Hoaresort", which was introduced in 1962 by C.A.R. Hoare. Because of its divide and conquer strategy this normally is the fastest sorting algorithm for an average amount of data.
Further lecture material by John Morris about Quicksort.