I have created a sorting algorithm that competes with Quick Sort and Introspective Sort, but is constructed in a much simpler way.
I have released the C++ code, (including it's design, written in pseudo-code) under the GNU GPL. I am freely releasing this algorithm for other programmers to use and develop further.
I have named the sorting algorithm Half-sort, it has the following features:
It is an in-place sort. (No extra data space needed.)
It works by "divide and conquer" recursion. (It is quite like Quick sort.)
It is not stable. (i.e. It does not keep the original order of identical items.)
Please use the link on the left to download it.