forked from saurabh73/sorting-algos
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbubble_sort.c
37 lines (28 loc) · 792 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
/* Bubble sort code */
#include <stdio.h>
int main()
{
int array[100], n, c, d, temp;
printf("Enter number of elements\n");
scanf("%d", &n);
printf("Enter %d integers\n", n);
for (c = 0; c < n; c++)
scanf("%d", &array[c]);
for (c = 0 ; c < n - 1; c++)
{
for (d = 0 ; d < n - c - 1; d++)
{
if (array[d] > array[d+1]) /* For decreasing order use < */
{
temp = array[d];
array[d] = array[d+1];
array[d+1] = temp;
}
}
}
printf("Sorted list in ascending order:\n");
for (c = 0; c < n; c++) {
printf("%d\n", array[c]);
}
return 0;
}