1#include <bits/stdc++.h>
2using namespace std;
3
4// Repeatedly swap adjacent out-of-order pairs.
5void bubbleSort(vector<int>& a) {
6 int n = a.size();
7 for (int i = 0; i < n - 1; ++i) {
8 bool swapped = false;
9 for (int j = 0; j < n - 1 - i; ++j) {
10 if (a[j] > a[j + 1]) {
11 swap(a[j], a[j + 1]);
12 swapped = true;
13 }
14 }
15 if (!swapped) break; // already sorted
16 }
17}
