Insertion sort is pretty good for this. I've seen a case where we were maintaining a list of items sorted by rank. The ranks changed occasionally, but usually only by +/- 5 at the most, in a list of several million. Insertion sort was much faster at putting them back in order compared to quicksort, in this one special case.
Don On Oct 16, 11:17 am, sravanreddy001 <sravanreddy...@gmail.com> wrote: > OK.. > what is expected? > > its again sort problem, unless the amount of distortion is constant, in > which a Binary search or Insertion sort can be employed to do in O(n) time. > Didn't give a programmatic thought. But, if the the amount of distortion is > of order n, then sort in O(n lg n) -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@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.
