-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBubble Sorting.c
58 lines (58 loc) · 942 Bytes
/
Bubble Sorting.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
53
54
55
56
57
58
//Implementation of Bubble Sort Sorting technique using arrays in C language
#include <stdio.h>
#include <stdlib.h>
//Global Variable
int n;
//Inputting elements of the array
void input(int a[50])
{
printf("Enter the elements\n");
int i;
for(i=0;i<n;i++)
scanf("%d",&a[i]);
display(a);
}
//Sorting the array
void sort(int a[50])
{
int i,j;
for(i=0;i<n-1;i++)
{
for(j=0;j<n-1-i;j++)
{
if(a[j]>a[j+1])
{
//Swapping the adjacent elements
int t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
}
}
//displaying the array
void display(int a[50])
{
int i;
printf("The Array->\n\t");
for(i=0;i<n;i++)
{
if(i==n-1)
printf("%d",a[i]);
else
printf("%d\t",a[i]);
}
}
//driver main function
int main()
{
printf("Enter the number of elements\n");
scanf("%d",&n);
int a[50];
input(a);
sort(a);
printf("\nAfter Sorting\n
");
display(a);
return 1;
}