[CentOS] [OT] stable algorithm with complexity O(n)

Ignacio Vazquez-Abrams ivazqueznet at gmail.com
Sat Dec 13 18:51:38 UTC 2008


On Sat, 2008-12-13 at 19:24 +0100, David Hláčik 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!

Merge sort? Insertion sort? Selection sort? timsort?

-- 
Ignacio Vazquez-Abrams <ivazqueznet at gmail.com>

PLEASE don't CC me; I'm already subscribed
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 197 bytes
Desc: This is a digitally signed message part
Url : http://lists.centos.org/pipermail/centos/attachments/20081213/803e67bb/attachment.bin 


More information about the CentOS mailing list