Bubble sort
tuhuuduc
c_cpp
a year ago
593 B
5
Indexable
#include <algorithm> // swap #include <iostream> using namespace std; void bubbleSort(int arr[], int n) { int i, j; bool swapped; for (i = 0; i < n - 1; i++) { swapped = false; for (j = 0; j < n - i - 1; j++) { if (arr[j] > arr[j + 1]) { swap(arr[j], arr[j + 1]); swapped = true; } } if (swapped == false) break; } } int main() { int arr[] = { 64, 34, 25, 12, 22, 11, 90 }; int N = sizeof(arr) / sizeof(arr[0]); bubbleSort(arr, N); cout << "Sorted array: \n"; for (int i = 0; i < N; i++) cout << " " << arr[i]; return 0; }
Editor is loading...
Leave a Comment