Quote:
Originally Posted by pradeep
That's right! But, for someone who is new to sorting algorithms Bubble Sort is the easiest to understand and implement.

well i think selection sort isbest for beginners in dat u dont have to bother to check which is smallest
i m giving code for it
if the nos are stored in an array' a'
a[i]=num[k]
i varies from 0 to 4 nd k varies from 1 to 5
Code:
#include<stdio.h>
#include<conio.h>
main()
{
int a[5],t,min,i,j;   \\considering all no. entered to be integer type
printf("\n please enter 5 no")  \\here u enter your 5 numbers
for( i=0;i<5;i++)
scanf("%d",&a[i]);
\\ now the sorting part

for(i=0;i<5;i++)
for(j=i+1;j<5;j++)
if(a[i]>a[j]){t=a[i];
                  a[i]=a[j];
                  a[j]=t;
                 }
\\ now to print the sorted array    
for(i=0;i<5;i++)
printf("\n %d"a[i]);


getch();
}
\\ yah dats it

Last edited by shabbir; 24Nov2006 at 23:00.. Reason: Code formating.