C PROGRAMMING PROGRAM • ARRAYS, SEARCHING & SORTING

Sort an Array Using Bubble Sort

Learn how to sort an array using bubble sort using a clear C program.

IntermediateBubble sortAdjacent swapEarly stop

PROBLEM UNDERSTANDING

Input and expected output

Sample input

6
5 1 4 2 8 3

Sample output

1 2 3 4 5 8

COMPLETE C PROGRAM

Complete C implementation

#include <stdio.h>

int main(void)
{
    int size, values[100];

    scanf("%d", &size);
    if (size < 1 || size > 100) return 1;
    for (int index = 0; index < size; index++) scanf("%d", &values[index]);
    for (int pass = 0; pass < size - 1; pass++) {
        int swapped = 0;
        for (int index = 0; index < size - pass - 1; index++) {
            if (values[index] > values[index + 1]) {
                int temporary = values[index]; values[index] = values[index + 1]; values[index + 1] = temporary;
                swapped = 1;
            }
        }
        if (!swapped) break;
    }
    for (int index = 0; index < size; index++) printf("%d%c", values[index], index == size - 1 ? '\n' : ' ');
    return 0;
}

CURRENT STEP

Select Start to walk through the important lines.

SELECTED LINE

No line selected

EXPECTED OUTPUT FOR THE SAMPLE

1 2 3 4 5 8

0%Step 0 of 0

PROGRAM EXPLANATION

Algorithm and explanation

Read the required input values.
Swap adjacent inversions so the largest unsorted value moves to the end after each pass.
Display the computed result.

Swap adjacent inversions so the largest unsorted value moves to the end after each pass.

EFFICIENCY

Time and space complexity

Time complexity

O(n²)

Auxiliary space

O(1)

DEBUGGING CHECKLIST

Common mistakes

Check this

Use the correct format specifier for every variable.

Check this

Initialize variables before using their values.

Check this

Check braces, semicolons and input order carefully.

Try it yourself

Practice: Run the program with the sample input, predict its output, and then test one boundary case of your own.