Selection Sort Places One Minimum at a Time — drill-2

DSA SheetLesson · no judge

1 of 4 parts done

DSA SHEET

1,432 items · 27 modules

Selection Sort Algorithm1/4 Reading7 min

Quizsign in

Code drill 1sign in

Code drill 2sign in

THIS ITEM

Selection 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 2 · 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 ascending selection sort for [29, 18, 7, 14, 3]. After each of the four passes, print the complete array, and skip the data-moving swap when minIndex equals i.

Java

Loading editor…

OUTPUT

Sample

[3, 18, 7, 14, 29]
[3, 7, 18, 14, 29]
[3, 7, 14, 18, 29]
[3, 7, 14, 18, 29]

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.