MadeEasy Test Series: Algorithms - Sorting

Question

Which of the following sorting techniques have best time complexity, if complexity is measured in terms of number of comparison?

 

A Insertion sort

B Selection sort

C Merge sort

D QuickSort

Comments

It depends on lot of factors.

1. Size of input. => Quick sort
2. How well is it sorted. => Insertion sort
3. Can your system allot more space for sorting to function. => Merge sort

i think question is incomplete,

Answer 1

In best case input, insertion sort.

In worst case input, merge sort.

Comments

Please give one best  answer as per option

---

One answer could be merge sort.

Answer 2

In worst case input merge sort is better.

Comments

the question is given to measure time complexity on the basis of no of comparisons not the asymptotic meaning

---

Time complexities can be obtained based on number of comparisons.