Question

How many passes does an insertion sort algorithm take for sorting an array of ‘n’ elements?

• A. \(\dfrac{n}{2}\)
• B. \(n\)
• C. \(n - 1\)
• D. \(n + 1\)

Hint:

Insertion sort starts from index 1 to \(n-1\), thus requires \(n-1\) passes.

Answer 1

The Correct Option is C

Insertion sort compares each element with the elements before it, starting from the second position. Therefore, for \(n\) elements, it takes \(n - 1\) passes.