// CPP program for implementation of Bubble sort //sorting #include<iostream> using namespace std; void swap(int *xp, int *yp) { int temp = *xp; *xp = *yp; *yp = temp; } void bubbleSort(int arr[], int n) { int i, j; for (i = 0; i < n-1; i++) for(j = 0; j < n-i-1; j++) if (arr[j] > arr[j+1]) swap(&arr[j], &arr[j+1]); } void printArray(int arr[], int size) { int i; for (i=0; i < size; i++) cout<<arr[i]<<endl; } int main() { int arr[] = {64, 34, 25, 12, 22, 11, 90}; int n = sizeof(arr)/sizeof(arr[0]); bubbleSort(arr, n); printArray(arr, n); return 0; } |
Sorted array:
11 12 22 25 34 64 90
Comments
Post a Comment