Bubble sort program in C

by Ranjith | December 4th, 2008.

Here is the program to sort the given integer in ascending order using bubble sort method. Please find the pictorial tutor of the bubble sorting.

Logic : The entered integers are stored in the array A. Here, to sort the data in ascending order, any number is compared with the next numbers for orderliness. i.e. first element A[0] is compared with the second element A[1]. If forth is greater than the prior element then swapping them, else no change. Then second element is compared with third element, and procedure is continued. Hence, after the first iteration of the outer for loop, largest element is placed at the end of the array. In the second iteration, the comparisons are made till the last but one position and now second largest element is placed at the last but one position. The procedure is traced till the array length.

If we complement the if condition in this program, it will give out the sorted array in descending order. Sorting can also be done in other methods, like selection sorting and insertion sorting, which follows in the next pages.

Bubble sort Image Demo

Here is the C program to sort the numbers using Bubble sort

#include<stdio.h>
void main()
{
	int A[20], N, Temp, i, j;
	clrscr();
	printf(“\n\n\t ENTER THE NUMBER OF TERMS…: “);
	scanf(“%d”,&N);
	printf(“\n\t ENTER THE ELEMENTS OF THE ARRAY…:”);
	for(i=0; i<N; i++)
	{
		gotoxy(25, 11+i);
		scanf(“\n\t\t%d”, &A[i]);
	}
	for(i=0; i<N-1; 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(“\n\tTHE ASCENDING ORDER LIST IS…:\n”);
	for(i=0; i<N; i++)
		printf(“\n\t\t\t%d”,A[i]);
	getch();
}

Download exe and source code here.

Share and Enjoy:

10 Responses to “Bubble sort program in C”

1
Nirav dangi Says:
November 10th, 2009 at 8:56 am
Program is nice…
but very typical to read….
try to use CODE TAG …
2
himanshi Says:
December 5th, 2009 at 11:01 am
it s very nice .you have cleared all my doubts.its to the point yet very helpful.
3
srikanth Says:
December 16th, 2009 at 8:59 am
ya…nice 2 understand….very helpful
4
srikanth Says:
December 16th, 2009 at 9:08 am
clear….eay to understand
5
Neill Van Says:
January 21st, 2010 at 6:41 pm
Thank you so much ..for the info really helpful

Btw how can i put the descending order along with the ascending???

output

Ascending order is: Descending order is
1 3
2 2
3 1

i tried duplicating it below before getch and changed < to greater than to i but still shows the same sort in ascending…Pls2x reply
6
Neill Van Says:
January 21st, 2010 at 7:14 pm
ohh i figured it out myself thanks anyway

for the initial info

#include
#include
void main()
{
int A[20],N,Temp,i,j;
clrscr();
printf(“\n\n\t Enter the number of terms:”);
scanf(“%d”,&N);
printf(“\n\t Enter the elements of the array”);
for(i=1;i<=N;i++)
{
gotoxy(25,5+i);
scanf("\n\t\t%d",&A[i]);
}
for(i=1;i<=N-1;i++)
for(j=1;jA[j+1])
{
Temp = A[j];
A[j] =A[j+1];
A[j+1] = Temp;
}
printf(“\n\t the Ascending order list is:\n”);
for(i=1; i to < */
/*———————————————————-*/
for(i=1;i<=N-1;i++)
for(j=1;j<=N-i;j++)
if (A[j]<A[j+1])
{
Temp = A[j];
A[j] =A[j+1];
A[j+1] = Temp;
}
printf("\n\t the Descending order list is:\n");
for(i=1;i<=N;i++)
printf("\n\t\t\t%d",A[i]);

getch();
}

Starting from the line:D i added the descending sort if anyone needs it there you have it

Sorry if my English is bad …..
7
Neill Van Says:
January 21st, 2010 at 7:16 pm
and by the way since its not shown what the includes are cause it may cause some errors

its include
include

Have a nice day evry1:D
8
Neill Van Says:
January 21st, 2010 at 7:17 pm
ohh my its still not shown

maybe i just type the
insides of the prototype

stdio.h and conio.h………
9
swati Says:
April 5th, 2010 at 12:24 am
ya it is gud
very helpful fo me to do it easily thankss………:):P
10
Nadeem Says:
June 24th, 2010 at 3:20 am
This one is also a great work .. thanks