Insertion sort compares each element with the elements before it, starting from the second position. Therefore, for \(n\) elements, it takes \(n - 1\) passes.
Was this answer helpful?
0
0
Top TS PGECET Computer Science & Information Technology Questions