Simple Bubble Sort Program using functions in C++

About this program

This is an example program in sorting programs. Read the concept first: Understanding Array in C++, then study the code and output below.

Definition

Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. It can be practical if the input is usually in sort order but may occasionally have some out-of-order elements nearly in position.

Example Program

/* Simple Bubble Sort Program Using Functions in C++*/
/* Data Structure C++ Programs,C++ Array Examples */

#include <iostream>
#include<conio.h>
#include<stdlib.h>

#define MAX_SIZE 5

using namespace std;

void bubble_sort(int[]);

int main() {
    int arr_sort[MAX_SIZE], i;

    cout << "Simple C++ Bubble Sort Example - Array and Functions\n";
    cout << "\nEnter " << MAX_SIZE << " Elements for Sorting : " << endl;
    for (i = 0; i < MAX_SIZE; i++)
        cin >> arr_sort[i];

    cout << "\nYour Data   :";
    for (i = 0; i < MAX_SIZE; i++) {
        cout << "\t" << arr_sort[i];
    }

    bubble_sort(arr_sort);
    getch();
}

void bubble_sort(int fn_arr[]) {
    int i, j, a, t;

    for (i = 1; i < MAX_SIZE; i++) {
        for (j = 0; j < MAX_SIZE - 1; j++) {
            if (fn_arr[j] > fn_arr[j + 1]) {
                //Swapping Values 
                t = fn_arr[j];
                fn_arr[j] = fn_arr[j + 1];
                fn_arr[j + 1] = t;
            }
        }

        cout << "\nIteration : " << i;
        for (a = 0; a < MAX_SIZE; a++) {
            cout << "\t" << fn_arr[a];
        }
    }

    cout << "\n\nSorted Data :";
    for (i = 0; i < MAX_SIZE; i++) {
        cout << "\t" << fn_arr[i];
    }
}

Sample Output

Simple Bubble Sort Example - Array and Functions

Enter 5 Elements for Sorting
677
45
32
1
17

Your Data   :   677     45      32      1       17
Iteration 1 :   45      32      1       17      677
Iteration 2 :   32      1       17      45      677
Iteration 3 :   1       17      32      45      677
Iteration 4 :   1       17      32      45      677

Sorted Data :   1       17      32      45      677

Related Pages

Learn the concept first, then study the code:

• Data Structures — Browse all Data Structures.
• Understanding Array in C++ — Tutorial — arrays underpin sorting algorithms.
• Simple Bubble Sort Program in C++ — More in sorting programs.
• Simple Insertion Sort Program in C++ — More in sorting programs.