@Dave: let us leave about Radix sort ,for it there are specific constraints
on the numbers.
@Amol sharma: i dont know what is cycle sort? Convey your answer in well
known sorting methods.
Ankur garg:In the phase of merging it compares the sorted sub arrays to
merge them .So it is not correct..
@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
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
quoted from wiki
While selection sort is preferable to insertion sort in terms of number of
writes (Θ(*n*) swaps versus Ο(*n*2) swaps), it almost always far exceeds
(and never beats) the number of writes that cycle
sorthttp://en.wikipedia.org/wiki/Cycle_sortmakes, as cycle sort is
theoretically
