Bubble_sort.cpp

// Bubble sort in C++

#include <iostream>
using namespace std;

// perform bubble sort
void bubbleSort(int array[], int size) {
    
  // loop to access each array element
  for (int step = 0; step < (size-1); ++step) {
      
    // check if swapping occurs
    int swapped = 0;
    
    // loop to compare two elements
    for (int i = 0; i < (size-step-1); ++i) {
        
      // compare two array elements
      // change > to < to sort in descending order
      if (array[i] > array[i + 1]) {

        // swapping occurs if elements
        // are not in intended order 
        int temp = array[i];
        array[i] = array[i + 1];
        array[i + 1] = temp;
        
        swapped = 1;
      }
    }

    // no swapping means the array is already sorted
    // so no need of further comparison
    if (swapped == 0)
      break;
  }
}

// print an array
void printArray(int array[], int size) {
  for (int i = 0; i < size; ++i) {
    cout << "  " << array[i];
  }
  cout << "\n";
}

int main() {
  // array initialization
  cout<<"Enter no. of elements"<<endl;
  int n;	cin>>n;
  int data[n];
  cout << "Enter elements " << endl;
  
  //  store input from user to array
  for (int i = 0; i < n; ++i) {
    cin >> data[i];
  }
  
  bubbleSort(data, n);
  
  cout << "Sorted Array in Ascending Order:\n";
  printArray(data, n);
}