forked from NITSkmOS/Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbubble_sort.c
48 lines (41 loc) · 884 Bytes
/
bubble_sort.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
#include <stdio.h>
void bubble_sort(int[], int);
void print_array(int[], int);
void swap(int*, int*);
int main() {
int arr[] = {45, 92, 54, 23, 6, 4, 12};
int n = sizeof(arr) / sizeof(arr[0]);
bubble_sort(arr, n);
printf("Sorted array: \n");
print_array(arr, n);
}
/* Function to swap two numbers */
void swap(int *a, int *b) {
int temp = *a;
*a = *b;
*b = temp;
}
/* Bubble Sort algorithm */
void bubble_sort(int arr[], int n) {
int i, j;
int swapped;
for (i = 0; i < n - 1; ++i) {
swapped = 0;
for (j = 0; j < n - i - 1; ++j) {
if (arr[j] > arr[j+1]) {
swap(&arr[j], &arr[j+1]);
swapped = 1;
}
}
/* If no two elements are swapped by inner loop, then break */
if (swapped == 0)
break;
}
}
/* Function to print array */
void print_array(int arr[], int size) {
int i;
for (i = 0; i < size; i++)
printf("%d ", arr[i]);
printf("\n");
}