Bubble Sort (C++)

gistfile1.cpp

#include <algorithm>

//Array to sort
int arr = []

//Get length of array
const int length = sizeof(arr)/sizeof(arr[0]);
int count = length;
bool swapped = false;

for(int i=0; i < length; i++){
  for(int x = 0; x < count - 1; x++){
    //Swap the next element with the next one if its smaller.
    if(arr[x+1] < arr[x]){
      //Actually swap the elements
      swap(arr[x], arr[x+1])
      swapped = true;
    }
  }
  
  //Lowers the count varible, since we can guarantee that the last element is sorted
  count=count - 1;
  
  //If no swaps occure, assume that the list is sorted and break to prevent additional cycles
  if(swapped){
    break;
  }
}