An algorithm published in 1965 by R. S. Scowen using a method similar to quicksort. It repeatedly splits the array to be sorted into parts such that all elements of one part are less than all elements of the other, with a third part in the middle consisting of a single element.