Question: Under what condition Insertion sort is faster than Merge sort? Group of answer choices If the list is descending sorted. If the list is nearly
Under what condition Insertion sort is faster than Merge sort?
Group of answer choices
If the list is descending sorted.
If the list is nearly sorted.
f the list random.
Never.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
