OPTIMIZED IMPLEMENTATION OF BUBBLE SORT IN C
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
48
49
50
51
52
| // Optimized implementation of Bubble sort #include <stdio.h> #include<stdbool.h> // To use bool variable in our code 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 isSorted; for (i = 0; i < n-1; i++) { isSorted = true ; for (j = 0; j < n-i-1; j++) { if (arr[j] > arr[j+1]) { swap(&arr[j], &arr[j+1]); isSorted = false ; } } // IF no two elements were swapped by inner loop, then break if (isSorted) 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; }
|