ConceptStep · learning platform for computer science

Visual Selection Sort

C programming · Lesson

C · lesson 19 / 27

Visual Selection Sort

Observe the minimum candidate, comparisons, and the swap that fixes one position at a time.

1 · Observe and predict

The concept

On each pass Selection Sort finds the minimum in the unsorted region and moves it into the first free position of the sorted prefix.

Mental model:

choose i → find minimum from i+1 → swap with v[i] → sorted prefix grows

2 · Flowchart + Array Lab

Follow the same algorithm as a flowchart

The flowchart keeps algorithm control visible; the Array Lab below makes cells, indices, comparisons, candidates and swaps visible.

Loading flowchart…
3 · Array / Search / Sorting Visualizer

Watch the data change step by step

Indices stay visible at all times. Sorting traces highlight comparisons, the current candidate, swaps and the region already sorted.

1 / 20

Initial array

Selection Sort builds the sorted prefix from left to right.

4 · Flowchart ↔ C · Run in Page

Lab 1 — Run the example program

Run C executes only the example shown on the left, using stdin on the right. The coding challenge below has a separate editor and test button.

Selection Sort Start the flowchart to synchronize the code
                        1#include <stdio.h>
                        2 
                        3int main(void)
                        4{
                        5    int v[5] = {5, 2, 4, 1, 3};
                        6    for (int i = 0; i < 4; i = i + 1)
                        7    {
                        8        int minimo = i;
                        9        for (int j = i + 1; j < 5; j = j + 1)
                        10        {
                        11            if (v[j] < v[minimo])
                        12                minimo = j;
                        13        }
                        14        int temp = v[i];
                        15        v[i] = v[minimo];
                        16        v[minimo] = temp;
                        17    }
                        18 
                        19    for (int i = 0; i < 5; i = i + 1)
                        20        printf("%d\n", v[i]);
                        21    return 0;
                        22}
Ready. Make a prediction before running.

                    
                

Lab 2 — Coding challenge: write your code — First selection sort step

Read five integers, swap the minimum into index zero, then print the array.

This is a different program from lab 1. Complete the starter code: Check all test cases compiles this editor and tests every input, including boundary cases.

5 · Guided practice

Check your prediction

After the first pass over {5, 2, 4, 1, 3}, which value ends up at position 0?

Challenge 1 / 5 · Understanding

Progress: 0 / 5 · correct: 0

Your competency map

What you need to know for Visual Selection Sort

ConceptStep separates what is required from what is recommended or useful as reinforcement. Only required prerequisites block your progress.

Current topic Strong skill Review due Needs reinforcement To be mastered Optional support

Relationships: solid line = required · dashed line = recommended · dotted line = reinforcement.

GUIDED LEARNING PATHS

Want to choose the next skill to develop?