Bubble Sort Algorithm Implementation Using C++

bubble_sort.cpp

/**
 *  @file    bubble_sort.cpp
 *  @author  Porimol Chandro, CSE 32D, World University of Bangladesh(WUB)
 *  @date    30/05/2017
 *
 *  @brief Bubble Sort Algorithm Implementation.
*/

#include <iostream>

using namespace std;

int main()
{

    int data[100], n, i, j, temp;
    bool swapped = false;

    cout << "Please enter the size of an array: ";
    cin >> n;

    for(i = 0; i<n; i++){
        cout << "Please enter the value of index[" <<i <<"]: ";
        cin >>data[i];
    }

    for(i = 0; i<n-1; i++){
        for(j = 0; j<n-1-i; j++){
            /* compare the adjacent elements */
            if(data[j] > data[j+1]){
                /* swapping */
                temp = data[j];
                data[j] = data[j+1];
                data[j+1] = temp;
                swapped = true;
            }
        }

        if(!swapped)
            break;
    }

    for(i = 0; i<n; i++){
        cout << "The value of index[" <<i <<"] is " <<data[i] <<endl;
    }

    return 0;
}