Question: Insertion sort is . . . . A . Very slow when given a list that is already in order B . Not as efficient

Insertion sort is....
A. Very slow when given a list that is already in order
B. Not as efficient as some sorting algorithms but useful in some applications
C. Only used to teach sorting algorithms
D. An algorithm that uses lots of extra memory

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 Programming Questions!