Skylinesort is a novel sorting algorithm that sorts integer keys. It outperforms current sorting algorithms when keys are clustered (not uniformly randomly distributed). I showed it to some profs at Stanford, and might publish it formally.
It sorts in time O(ku-ulog(u)+n), where k is the number of bits in each key, u is the number of unique elements, and n is the total number of elements.
It sorts in time O(ku-ulog(u)+n), where k is the number of bits in each key, u is the number of unique elements, and n is the total number of elements.