Hi, I've been searching the net for info on the radix exchange sort algorithm, inparticular, its order of complexity. Its got a little confusing for me as I found a lot of stuff on radix sort. Is there a difference in the way they operate as from what I can gather, radix exchange swaps 1s and 0s in binary from the top and bottom of the list of numbers and radix sort uses a partition value and sub arrays similar to quicksort.
I also got confused with the order of complexity. Radix sort has O(NlogN) complexity, which I can understand as it uses recursion and is approx. halved, but radix exchange was said to be O(bN) where b is the number of bits. I am not sure how this works as when the MSB column is completed, then two numbers are sorted and can be ignored and so on until tht sort is complete.
Sorry if thats not clear, but thanks if anyone can help me with this.