Program in the C programming language to sort all the elements in the array in the ascending order. This programs uses the bubble sort method to sort the numbers in ascending order.

**Definition Bubble Sort**– Bubble sort is a simple sorting technique in which passes are used and after each pass larger no. obtains it’s sorted position. To sort the elements ‘**n-1**‘ passes are used where **n** is the total number of elements.

/* C program to arrange or sort the array in the ascending order */ #include<stdio.h> #include<conio.h> void main() { int ar[100],j,n,i,tmp; printf(" Enter the size of the array \t"); scanf("%d",&n); printf("Now enter the elements in the array \t"); for(i=0;i<n;i++) { scanf("%d",&ar[i]); } printf("\n Array is - "); for(i=0;i<n;i++) { printf("\t %d",ar[i]); } for(i=0;i<n;i++) { for(j=0;j<n-i;j++) { if(ar[j]>ar[j+1]) { tmp=ar[j]; ar[j]=ar[j+1]; ar[j+1]=tmp; } } } printf("\n\n Array in the ascending order is - \n"); for(i=0;i<n;i++) { printf("\t %d",ar[i]); } getch(); }

**Input –**

Enter the size of the array – 5

Array is – 23 65 10 45 34

**Output –**

Array in the Ascending order is – 10 23 34 45 65

Make it abit easy and understandable

you can try this link

http://techtutorz.blogspot.in/2014/04/sorting-array-elements-in-ascending.html

make it easy study material for students…

thanks….i was in need of this program….i got it now

Hello ! I am, John paul Dengo. and i need to learn morrow about C & C++. Tha’s why i’m interesting to you.

thanks i got the prgm easily frm this site

there is a bug

for(j=0;j<n-i;j++) === wrong

for(j=0;j<n-1;j++)==right

well, n-1 is wrong there’s no bug, prog. is simple and easy.

for n-i its printing -2 garbage value at the begining in case of static arrays …for dynamic arrays its fine..

for static n-1 is correct.

really helpful 4 my wife febin

for(j=0;j<n-i;j++) there is a bug, because when j=n-i-1, which is the maximum value of j, j+1=n-i and there is no value for ar[j+1]. In this case ar[j+1] will be a random number chosed by the computer. The correct answer should be for(j=0;jar[j+1]) into if(ar[j]<ar[j+1]) and then we will find the bug.

Thanks…

I’m little satisfied on searching wth this site

don’t worry i will gave’s part and how you can implement you’r program by using c++ i’m also a student and i have alred implement a simple program achuly i need to know more about c++

Please give me programs on an array daily one to my ewail id. Thanks

Thank you for help

this program is a grt help to me

thank u

Stands back from the keyboard in amntemeaz! Thanks!

give atleast one question answer and i,e.,complete

iz really helpful……….

soooooooooo helpful……….

Itz very helpful……….

Εncore un sublime article : j’en discuterai dans la semaine avec mes voisins

Very Helpful article while array size is user defined

thnkful

but i wnt 2 knw y we use j loop??

http://www.stucorner.com/It-training.aspx

Of course there is bug

line 25 instead of

25 for(j=0;j<n-i;j++)

should read

25 for(j=0;j<n-1-i;j++)

that will fix a problem going beyond array bound.

can any one give me the code of implement heap,delete element from heap,find the maximum and minimum number from the heap this code must in array implement.

Its not j<(n-i) but j<(n-1). If not for this change,you will be accessing array out of bounds. Try executing for n=3 and check. The loop will execute even for j=2 when i=0 and access array[3]