Vidyalelo
Data Structure · Q203

Sorting Algorithms

Programming · Data Structure · question 203

Q203

Why is insertion sort preferred over other sorting algorithms (like selection sort, bubble sort etc.) for Tim sort implementation?

A.
Because insertion sort is faster and adaptive
Answer
B.
Because insertion sort requires less space
C.
Because insertion sort is easy to implement
D.
Because insertion sort is easy to understand

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board