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@xxxxxxxxx> PLEASE don't CC me; I'm already subscribed
Attachment:
signature.asc
Description: This is a digitally signed message part
_______________________________________________ CentOS mailing list CentOS@xxxxxxxxxx http://lists.centos.org/mailman/listinfo/centos
