Day21.cpp

#include <bits/stdc++.h>

using namespace std;

int main() {
    int n;
    int numberOfSwaps = 0;
    int i,j;
    cin >> n;
    vector<int> a(n);
    for(int a_i = 0; a_i < n; a_i++){
    	cin >> a[a_i];
    }
    // Write Your Code Here
    
    for (i = 0; i < n; i++) {
    // Track number of elements swapped during a single array traversal
    
    for (j = 0; j < n - 1; j++) {
        // Swap adjacent elements if they are in decreasing order
        if (a[j] > a[j + 1]) {
            swap(a[j], a[j + 1]);
            numberOfSwaps++;
        }
    }
    
    // If no elements were swapped during a traversal, array is sorted
    if (numberOfSwaps == 0) {
        break;
    }
}

cout<<"Array is sorted in "<<numberOfSwaps<<" swaps."<<endl;
cout<<"First Element: "<<a[0]<<endl;
cout<<"Last Element: "<<a[n-1];

    
    return 0;
}