This example shows implementing bubble sort algorithm.
01
#include <stdio.h>
02
#include<conio.h>
03
#include <time.h>
04
05
int
main(
void
)
06
{
07
i,j,k,a[20],n;
08
printf
(
"Enter size of array :"
);
09
scanf
"%d"
,&n);
10
11
"\nEnter the elements of the array : "
12
for
(i=0;i<n;i++) {
13
,&a[i]);
14
}
15
16
(i=0;i<n;i++)
17
18
(j=0;j<n-i;j++)
19
20
if
(a[j]>a[j+1]) {
21
a[j]=a[j]+a[j+1]-(a[j+1]=a[j]);
22
23
24
25
26
"\nElements after sorting: "
27
28
"\t%d"
,a[i]);
29
30
getch();
31
return
0;
32
Enter size of array :6 Enter the elements of the array : 6 2 1 8 3 9 Elements after sorting: 1 2 3 6 8 9
