Insertion Sort: Each Pass Inserts One Key — drill-1

DSA SheetLesson · no judge

1 of 4 parts done

DSA SHEET

1,432 items · 27 modules

Insertion Sort Algorithm1/4 Reading8 min

Quizsign in

Code drill 1sign in

Code drill 2sign in

Insertion Sort List2 parts

THIS ITEM

Insertion Sort Algorithm

1 of 4 parts done. The item is marked complete on the sheet only when all of them are.

Every item expands into its own parts. Reading, quiz and drills swap the centre pane; Practice opens the code editor.

PART STATUS

Done — counts towards the item
Not started
Item with parts still open

1 of 4 parts done in this item

CODE DRILL 1 · RUN ONLY

Write it, run it, read the output

This is a scratch drill — your code runs, nothing is graded or recorded. No test cases, no expected output, no verdict.

TASK

Implement insertion sort for the array [5, 2, 4, 6, 2, 3]. Save each key, shift larger values to the right, place the key in the hole, and print the array after each of the five outer passes.

C++

Loading editor…

OUTPUT

Sample

2 5 4 6 2 3 
2 4 5 6 2 3 
2 4 5 6 2 3 
2 2 4 5 6 3 
2 2 3 4 5 6

What a finished answer prints, from the lesson. Nothing has run yet — press Run and this is replaced by your program’s own output.

3 parts left before this item is marked done.Next part · Code drill 2