But still it will depend on the number of distortions.If the number of distortions are large enuf(<=n/2) then its better to resort in the most generic case.Even insertion sort would cost o(n^2) in that case.
On Tue, Oct 18, 2011 at 3:57 AM, sravanreddy001 <sravanreddy...@gmail.com>wrote: > Yes.. And the reason is best case of insertion sort is in the order of n. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/_OJfijjiFVoJ. > 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. > > -- Saurabh Singh B.Tech (Computer Science) MNNIT ALLAHABAD -- 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.
