c++ buble sort

void bubbleSort(int arr[], int n) 
{ 
   int i, j; 
   for (i = 0; i < n-1; i++)       
  
       // Last i elements are already in place    
       for (j = 0; j < n-i-1; j++)  
           if (arr[j] > arr[j+1]) 
              swap(&arr[j], &arr[j+1]); 
} 
  

 int arr[]= {2,3,5,6,1,2,3,6,10,100,200,0,-10};
    int n = sizeof(arr)/sizeof(int);  
    sort(arr,arr+n);

    for(int i: arr)
    {
        cout << i << " ";
    }

void bubbleSort(int arr[], int n) 
{ 
   int i, j; 
   bool swapped; 
   for (i = 0; i < n-1; i++) 
   { 
     swapped = false; 
     for (j = 0; j < n-i-1; j++) 
     { 
        if (arr[j] > arr[j+1]) 
        { 
           swap(&arr[j], &arr[j+1]); 
           swapped = true; 
        } 
     } 
  
     // IF no two elements were swapped by inner loop, then break 
     if (swapped == false) 
        break; 
   } 
} 

void bubbleSort(int arr[], int size){
  int temp = int();
  //print out the unsorted values
  for ( int i = 0; i < size -1; i ++)
    cout << arr[i] << "\t";
  cout << endl << endl;
  
  
  for (int i = 1; i < size; i++ ){
  	for(int j = 0; j < size - i ; j ++){//size-i is the sorted part of the array	
   		if( arr[j] > arr[j + 1]){//if the value is greater than the next value in the array, swap it
          temp = arr[j];
          arr[j] = arr[j+1];//swap the two values
          arr[j+1] = temp;
          
        }//end if
    }//end for
  }//end for
  
}//end bubbleSort

Psuedo code:

Procedure bubble_sort (array , N)
               array – list of items to be sorted
               N – size of array
begin
               swapped = false
               repeat
                             for I = 1 to N-1 
                                              if array[i-1] > array[i] then
                                                           swap array[i-1] and array[i]
                                                           swapped = true
                                              end if
                              end for
                until not swapped
end procedure