Data Structures Bubble Sort C Program

Data Structures Lab Manual / Data Structures Bubble Sort C Program

Program Name: Write a C Program for Linear Seach in Data Structures

Theory

Bubble / sinking sort compares adjacent elements and swaps them if they are in 
the wrong order and process pass through the list is repeated until the list 
is sorted.

Program Code

#include<stdio.h> 
#include<conio.h> 
void bubblesort(int [],int); 

void main()
{
int a[20],i,n; 

printf("Enter Number of Elements: "); 
scanf("%d",&n);


printf("Enter Array Elements: "); 
for(i=0;i<n;i++)
scanf("%d",&a[i]);

bubblesort(a,n);
getch();
}

void bubblesort(int a[],int n)
{
int i,temp,j; 

for(i=1;i<n;i++)
for(j=0;j<n-i;j++)
if(a[j]>a[j+1])
{
temp=a[j]; 
a[j]=a[j+1]; 
a[j+1]=temp;
}

printf("Sorted Array: ");
for(i=0;i<n;i++) 
printf("\t%d",a[i]);
}

Input:
Enter Number of Elements: 5
Enter Array Elements: 5 3 7 1 9

Output:
Sorted Array: 	1	3	5	7	9

Home Back