ConceptStep · learning platform for computer science

Visual Bubble Sort

C programming · Lesson

C · lesson 20 / 27

Visual Bubble Sort

Follow adjacent pairs, comparisons, and swaps as larger elements move toward the right.

1 · Observe and predict

The concept

Bubble Sort compares adjacent elements. If they are out of order it swaps them; after each pass a suffix of the array is already final.

Mental model:

compare v[j],v[j+1] → optional swap → continue → sorted suffix 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 / 22

Initial array

Bubble Sort compares adjacent pairs; larger values bubble toward the 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.

Bubble Sort Start the flowchart to synchronize the code
                        1#include <stdio.h>
                        2 
                        3int main(void)
                        4{
                        5    int v[5] = {5, 1, 4, 2, 3};
                        6    for (int i = 0; i < 4; i = i + 1)
                        7    {
                        8        for (int j = 0; j < 4 - i; j = j + 1)
                        9        {
                        10            if (v[j] > v[j + 1])
                        11            {
                        12                int temp = v[j];
                        13                v[j] = v[j + 1];
                        14                v[j + 1] = temp;
                        15            }
                        16        }
                        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 bubble sort pass

Read five integers, perform one full ascending bubble sort pass and 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

In the first comparison of {5, 1, 4, 2, 3}, what happens to 5 and 1?

Challenge 1 / 5 · Understanding

Progress: 0 / 5 · correct: 0

Your competency map

What you need to know for Visual Bubble 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?