ooops wrong approach... :( On Thu, Aug 26, 2010 at 10:44 PM, Naveen Kumar <naveenkumarve...@gmail.com>wrote:
> Can't we use bubble sort on remaining elements? > > > On Thu, Aug 26, 2010 at 5:25 PM, sourav <souravs...@gmail.com> wrote: > >> Let A[1..n] be an array such that the first (n − √n) elements are >> already sorted >> (though we know nothing about the remaining elements). Give an >> algorithm that >> sorts A in "substantially better" than (n log n) steps. >> >> This question is from chapter 4 : Algorithm Design Manual by S Skiena >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to algoge...@googlegroups.com. >> To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> >> . >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > > > -- > Cheers > Naveen Kumar > -- Cheers Naveen Kumar -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
