Question: Insertion Sort is stable because: a . It has a worst - case time complexity of O ( n 2 ) b . It requires
Insertion Sort is stable because:
a It has a worstcase time complexity of
b It requires extra space for sorting
c It preserves the relative order of equal elements during sorting
d It doesn't maintain the relative order of equal elements
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
