0118CppBubbleSort

#include <iostream>
using namespace std;

void swap(int *a, int *b){
   int temp;
   temp = *a;
   *a   = *b;
   *b   = temp ;
}

void bubbleSort (int arr[], int n){
    bool swapped;
    for (int i=0; i<n-1; i++){
        swapped = false ;
        for (int 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;
    }
}

void bubbleSortRevers(int arr[], int n){
    bool swapped ;
    for (int i=0; i<n-1; i++){
        swapped = false;
        for(int 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 ;
    }
}

void printArray(int arr[], int size){
    for (int i=0; i<size; i++){
       cout<<arr[i]<<"  " ;
    }
}

int main() {
    cout << "Swap :\n";
    int a=4, b=10;
    cout<<"a = "<<a<<" b = "<<b<<endl;
    swap(&a, &b);
    cout<<"a = "<<a<<" b = "<<b<<endl;
    
    int arr[] = {2,34,45,89,3,4,6,2,34,90,99};
    int n = sizeof(arr)/sizeof(arr[0]);
    cout<<"Print array :\n";
    printArray(arr,n);
    cout <<endl;
    
    bubbleSortRevers (arr,n);
    cout <<"Print reverse array \n";
    printArray(arr ,n);
    
    bubbleSort (arr,n);
    cout<<"\nBubble sort array :\n";
    printArray(arr, n);
    
    return 0;
}