-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSorting
47 lines (33 loc) · 944 Bytes
/
Sorting
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
/* Bubble sort code */
#include<stdio.h>
#include<stdlib.h>
//bubble sort using function
void bubble_sort(int [], int); //function definition
int main() {
int array[100], n, c, d, swap;
printf("Enter number of elements\n");
scanf("%d", &n);
printf("Enter %d integers\n", n);
for (c = 0; c < n; c++)
scanf("%d", &array);
bubble_sort(array, n);
printf("Sorted list in ascending order:\n");
for (c = 0; c < n; c++)
printf("%d\n", array);
return 0;
}
void bubble_sort(int list[], int n) //function body
{
int c, d, t;
for (c = 0; c < (n - 1); c++) //outer loop
{
for (d = 0; d < n - c - 1; d++) //inner loop
{
if (list[d] > list[d + 1]) {
/* Swapping */
t = list[d]; //using temporary variable
list[d] = list[d + 1];
list[d + 1] = t;
}
}
}