17 Dec
2008
17 Dec
'08
9:17 a.m.
On Sat, Dec 13, 2008 at 10:24 AM, David Hláčik david@hlacik.eu wrote:
Hi guys,
i am really sorry for making offtopic, hope you will not kill me, but this is for me life important problem which needs to be solved within next 12 hours..
I have to create stable algorithm for sorting n numbers from interval [1,n^2] with time complexity O(n) .
Can someone please give me a hint. Would be very very thankful!
Knuth.
Art of Computer Programming Volume 3: Sorting and Searching (2nd Edition) by Donald E. Knuth
--
NiftyCluster
T o m M i t c h e l l