bubble sort

#include<bits/stdc++.h>
using namespace std;
void swap(int *xp, int *yp) 
{ 
    int temp = *xp; 
    *xp = *yp; 
    *yp = temp; 
} 
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 (swapped == false) 
        break; 
   } 
} 
int main()
{
  int a[]={7,5,87,2,6,43,99,1};
  int n=sizeof(a)/sizeof(int);
  bubbleSort(a,n);
  for(int i=0;i<n;i++) cout<<a[i]<<" ";
}
// optimised bubble sort
// best TC: O(n); worst TC O(n^2);
// auxiliary space: O(1)
// isyntaxerror;