Sorting algorithms for integer numbers - "binary mode"

Vote count:

0

I am looking on several algorithm. Usuall O(n log n) algorithms compare numbers as they are, there is not a change to get better than log performance.

Fast nearly O(n) algorithms like Radix sort, Counting sort, Bitonic sort.. are using different approach and therefore can run "faster". The faster is usually joined with bigger memory usage. I have been looking / trying to create some algorithm, that can sort numbers in nearly O(n) but with usage of bit representation of numbers. So something similar to Radix sort, but in binary mode. Is there any algorithm like this, since I have not found any reference ?

asked 2 mins ago

Martin Perry

2,476