[OT] stable algorithm with complexity O(n)

Wojciech Muła wojciech_mula at poczta.null.onet.pl.invalid
Sat Dec 13 20:04:02 CET 2008

"David Hláčik" <david at hlacik.eu> wrote:

> I have to create stable algorithm for sorting n numbers from interval
> [1,n^2] with time complexity O(n) .

Some kind of radix sort or counting sort.  These algo. has O(n) complexity.


More information about the Python-list mailing list