Bubble sort program in C
Thursday, December 4th, 2008Here 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(); }
Description :
Simillar Posts
50 Responses to “Bubble sort program in C”
Leave a Reply
Free email signup
Handheld Vehicle Lock Control System Using Wireless Communication (IR / RF)
What is a global variable?
What is a local variable?
What is the use of sizeof() operator in C?
Remote System Monitoring and Controlling via Web based Mobile or Desktop Application
Dependency Injection in C# .NET
what is Void Pointer?
What is dangling pointer?
Delegate and Events in C# .NET
Mobile Information Device Profile (MIDP 2.0) in J2ME
Recent Members
This is the one stop educational site for all Electronic and Computer students. If you want to learn something new then we are here to help. We work on Microcontroller projects, Basic Electronics, Digital electronics, Computer projects and also in basic c/c++ programs.
#Home #Sitemap #Submit #Terms of Use
Copyright©2011 electrofriends.com All Rights Reserved
Contact:info@electrofriends.com | Powered by Dhyeya
Program is nice…
but very typical to read….
try to use CODE TAG …
it s very nice .you have cleared all my doubts.its to the point yet very helpful.
ya…nice 2 understand….very helpful
clear….eay to understand
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
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 …..
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
ohh my its still not shown
maybe i just type the
insides of the prototype
stdio.h and conio.h………
ya it is gud
very helpful fo me to do it easily thankss………:):P
This one is also a great work .. thanks
this information is very helpful for not only students even also teachers. simply its too helpful.
FOR ME its very helpful.
very nice ..
the information is very useful. THANKS FOR THIS
Its good one. But i dono y we r putting j<N-i i dono
plz tell me
very nice u done great job
thanks…lucid way..
VERY EASY TO UNDERSTAND ….THNKS A LOT!!!
nice illusion
according to me,this program is ineffecient.
try to reduce its complexity if array is already sorted or
PARTIALLY SORTED.?????????????
hupp
thank u…..
really nice to understand…!
cool ans dude…………. thank you so much
fuck!!!!
in dev c++ it shows gotoxy undeclaredd
There is an index boundary problem in the code.
for(i=0; i<N-1; i++)
for(j=0; jA[j+1])
When i = 0, in the second for loop, when j = N – 1, the A[j+1] is over boundary.
This tutorial is very nice. Thankyou.
U r doing an excellent job…..programs r very clear to understand
programs has logical error. It works for MOST set of input but not ALL.
to make it work properly it should be j<n-i-1 in the second loop instead of j<n-i
great dude
ur program was quite useful
very easy to understand
ur program was really very interesting.It gave clearcut idea about bublesort.Now we are very much clear with it.U can send more programs in c it will be very much useful for students.
ur program was not that much lengthy so it is easy to understand.
ur program was not that much lengthy,it is easy to get the concept behind bubble sort.
Its nt for diploma students
very nice…help helpful and thanks
Your blog is pretty cool to me and your subject matter is very relevant. I was browsing around and came across something you might find interesting. I was guilty of 3 of them with my sites. “99% of site managers are guilty of these 5 errors”. http://is.gd/jhKkC5 You will be suprised how fast they are to fix.
what is gotoxy(25,11+i); statement
I did not understand
thank u so much.its really helpful.
nice
thank u
thanx its really easy………
Dude… it’s superb………
easy understanding……. it’s really helps alot to me now….
please post for merge sort also … like this.
Thanks alot……….
It is compiling with 26 Errors & 5 Warnings…….
Plz. modify it…….
i didn’t understand the the line for:
“for(i=0; i<N-1; i++)
for(j=0; j<N-i;j++)"
why it had a N-1?
how it works?
thanks a lot!
someone will help me??
it runs!! thanxx dude
bubble sorting program not execute
#include
#incluse
#include
void main()
{
clrscr();
int k,i,n=10,TEMP=0,PTR=0;
int DATA[10]={26,24,3,17,25,24,13,60,47,1};
for (k=1;k<n;k++)
{
int PTR=0;
while (PTRDATA[PTR+1])
{
TEMP=DATA[PTR];
DATA[PTR+1]=TEMP;
}
DATA[PTR]=DATA[PTR+1];
PTR++;
}
}
for( i=0;i<10;i++)
{
printf("%d\n ",DATA[i]);
}
getch();