-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBubble_Sort.cpp
More file actions
47 lines (38 loc) · 984 Bytes
/
Copy pathBubble_Sort.cpp
File metadata and controls
47 lines (38 loc) · 984 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
#include <iostream>
#include <vector>
using namespace std;
void bubbleSort(vector<int>& arr) {
int n = arr.size();
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] and arr[j + 1]
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
swapped = true;
}
}
// If no two elements were swapped in the inner loop, then the array is already sorted
if (!swapped) {
break;
}
}
}
int main() {
vector<int> arr = {64, 34, 25, 12, 22, 11, 90};
cout << "Array before sorting: ";
for (int x : arr) {
cout << x << " ";
}
cout << endl;
bubbleSort(arr);
cout << "Array after sorting: ";
for (int x : arr) {
cout << x << " ";
}
cout << endl;
return 0;
}