Senin, 22 September 2014

IMPLEMENTATION OF SELECTION SORT PROGRAMs

IMPLEMENTATION OF SELECTION SORT



PROGRAM:



#include

#include

int n;

void main()

{

int a[10],i,j;

void selection(int a[10]);

clrscr();

printf("\n\t\tSelection Sort");

printf("\nHow many Elements are there");

scanf("%d",&n);

printf("\nEnter the element");

for(i=0;i
scanf("%d",&a[i]);

selection(a);

getch();

}

void selection(int a[10])

{

int i,j,min,temp;

for(i=0;i<=n-2;i++)

{

min=i;

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

{

if(a[j]
min=j;

}

temp=a[i];

a[i]=a[min];

a[min]=temp;

}

printf("\n Sorted List is\n");

for(i=0;i
printf("\n%d",a[i]);

}













OUTPUT:





Selection Sort

How many Elements are there 5



Enter the element

5

4

3

2

1





Sorted List is



1

2

3

4

5











CIET college Programs,LAB Programs for Engineering Students,DAA LAB Programs,DSA LAB Programs,Remoboys,karthik,Remokn,Student3k,programs source code,Design Analysis And Algorithms LAB Programs,Data Structures and Algorithms LAB Programs,LAB Codings,Coimbatore Institute of Engineering and Technology ( CIET )


0 komentar:

Posting Komentar

Blog Archive