Created
March 7, 2021 09:05
-
-
Save gunavaran/0f256377459bc7ae32ae6160fdd0c190 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Acknowledgement: https://www.geeksforgeeks.org/bubble-sort/ | |
// Implementation of Bubble sort | |
#include <stdio.h> | |
void swap(int *xp, int *yp) | |
{ | |
int temp = *xp; | |
*xp = *yp; | |
*yp = temp; | |
} | |
// An optimized version of Bubble Sort | |
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 no two elements were swapped by inner loop, then break | |
if (swapped == false) | |
break; | |
} | |
} | |
/* Function to print an array */ | |
void printArray(int arr[], int size) | |
{ | |
int i; | |
for (i=0; i < size; i++) | |
printf("%d ", arr[i]); | |
printf("n"); | |
} | |
// Driver program to test above functions | |
int main() | |
{ | |
int arr[] = {64, 34, 25, 12, 22, 11, 90}; | |
int n = sizeof(arr)/sizeof(arr[0]); | |
bubbleSort(arr, n); | |
printf("Sorted array: \n"); | |
printArray(arr, n); | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment