"David Hláčik" <da...@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. w. -- http://mail.python.org/mailman/listinfo/python-list
