Selection Sort Algorithm — drill-1

DSA SheetLesson · no judge

1 of 4 parts done

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 selection sort for the array [29, 10, 14, 29, 13]. Keep the swap after each complete scan, skip self-swaps, and print the array after every outer-loop pass.

C++

Loading editor…

OUTPUT

Sample

10 29 14 29 13
10 13 14 29 29
10 13 14 29 29
10 13 14 29 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.

Previous · Insertion Sort Algorithm3 parts left before this item is marked done.Next part · Code drill 2