Question: Insertion Sort is stable because: ot yet swered ked out of a . It preserves the relative order of equal elements during sorting b .

Insertion Sort is stable because:
ot yet swered
ked out of
a. It preserves the relative order of equal elements during sorting
b. It doesn't maintain the relative order of equal elements
Oc. It has a worst-case time complexity of O(n^2)
Od. It requires extra space for sorting

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!