We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Sorting: Bubble Sort
  2. Discussions

Sorting: Bubble Sort

  • n_a_vorontcov
     + 0 comments

    C++ SOLUTION

    void countSwaps(vector<int> a) {
    int count = 0;
    for (int i = 0; i < a.size() - 1; i++) {
        for (int j = 0; j < a.size() - i - 1; j++) {
            if (a[j] > a[j + 1]) {
                swap(a[j],a[j+1]);
                count++;
            }
        }
    }
    cout << "Array is sorted in " << count << " swaps." << endl << "First Element: " << a[0] << endl << "Last Element: " << a[a.size()-1];
}