There are several well known sort routines such as quicksort
which can sort a list of numbers,reals or integers using compares in typicaly order(n Log n) operations, where n is the number of items to be sorted and in the worst case this can become order(n^2).
There is routine which can sort n items in order(n) operations,without using any compare operations, can anyone tell me what it is and why it maybe a little little difficult to implement on a 8052 when n gets too large?
Not you eric,Micheal and company.