I think Merge Sort doesnt require any swapping . So , for 3 my answer wud be Merge Sort
On Mon, Nov 21, 2011 at 11:55 AM, Dave <dave_and_da...@juno.com> wrote: > @Kumar: For question 1, the answer is radix sort. It doesn't use data > comparisons at all. > > Dave > > On Nov 21, 12:04 am, kumar raja <rajkumar.cs...@gmail.com> wrote: > > if we have set of n elements then > > > > 1) which sorting method uses least number of comparisons?? > > > > 2) which sorting method uses least number of swaps?? > > > > 3) suppose the array is 2 8 4 6 5 9 > > if we want to swap 8 and 5 the cost is 2(5-2)=6 .here 5 and 2 are > > indices of 5 and 8. > > so what sorting method minimizes the cost, i want the answer in general > > case ,not for this particular array. it is also called least distance > > sorting > > > > -- > > Regards > > Kumar Raja > > M.Tech(SIT) > > IIT Kharagpur, > > 10it60...@iitkgp.ac.in > > -- > 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. > > -- 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.
