bubble_sort.cpp

#include <bits/stdc++.h>

using namespace std;

vector<string> split_string(string);


void countSwaps(vector<int> a) {
    int n;
    int temp;
    int swaps;
    bool isSorted;
    int largest_index;
    
    n = a.size();
    swaps = 0;
    isSorted = false;
    largest_index = n-1;
    
    while(!isSorted){
        isSorted =  true;
        for(int i = 0; i < largest_index; i++){
            if(a[i] > a[i+1]){
                temp   = a[i];
                a[i]   = a[i+1];
                a[i+1] = temp;
                swaps++;
                isSorted = false;
            }
        }
        largest_index--;
    }
    
    cout << "Array is sorted in "<< swaps <<" swaps." << endl;
    cout << "First Element: " << a[0] << endl;
    cout << "Last Element: "  << a[n-1] << endl;

}


int main()
{
    int n;
    cin >> n;
    cin.ignore(numeric_limits<streamsize>::max(), '\n');

    string a_temp_temp;
    getline(cin, a_temp_temp);

    vector<string> a_temp = split_string(a_temp_temp);

    vector<int> a(n);

    for (int i = 0; i < n; i++) {
        int a_item = stoi(a_temp[i]);

        a[i] = a_item;
    }

    countSwaps(a);

    return 0;
}

vector<string> split_string(string input_string) {
    string::iterator new_end = unique(input_string.begin(), input_string.end(), [] (const char &x, const char &y) {
        return x == y and x == ' ';
    });

    input_string.erase(new_end, input_string.end());

    while (input_string[input_string.length() - 1] == ' ') {
        input_string.pop_back();
    }

    vector<string> splits;
    char delimiter = ' ';

    size_t i = 0;
    size_t pos = input_string.find(delimiter);

    while (pos != string::npos) {
        splits.push_back(input_string.substr(i, pos - i));

        i = pos + 1;
        pos = input_string.find(delimiter, i);
    }

    splits.push_back(input_string.substr(i, min(pos, input_string.length()) - i + 1));

    return splits;
}