Ace Test Series: Algorithms - Sorting

Question

Comments

Selection and insertion seems correct. But i will go with Insertion. What is given??

---

quick sort

---

Any explanation was given??

---

both insertion and selection are correct according to the given constraints

but if we have additional constraint that is like best case time complexity then we have insertion sort is a good choice.

Answer 1

Option A) is the ans

Insertion sort , is having minimum space requirements

Insertion sort is faster for small n because Quick Sort has extra overhead from the recursive function calls. Insertion sort is also more stable than Quick sort and requires less memory.

insertion sort is often used as the recursive base case (when the problem size is small).

• Insertion sort: inserts the next element at the correct position;

• Selection sort: selects the smallest element and exchange it with the current item

(Insertion sort) In-place, i.e., only requires a constant amount O(1) of additional memory space

Source: http://cheetahonfire.blogspot.com/2009/05/selection-sort-vs-insertion-sort.html