Home / EG Comp Lab / C Language / Selection Sort: C Program

Selection Sort: C Program

Selection sort in C: C program for selection sort to sort numbers. This code implements selection sort algorithm to arrange numbers of an array in ascending order. With a little modification it will arrange numbers in descending order.

[message_box title=”Program” color=”blue”]

#include <stdio.h>
#include <conio.h>

void main()
{
int array[100], n, c, d, position, swap;
clrscr();

printf(“Enter number of elements\n”);
scanf(“%d”, &n);

printf(“Enter %d integers\n”, n);

for ( c = 0 ; c < n ; c++ )
scanf(“%d”, &array[c]);

for ( c = 0 ; c < ( n – 1 ) ; c++ )
{
position = c;

for ( d = c + 1 ; d < n ; d++ )
{
if ( array[position] > array[d] )
position = d;
}
if ( position != c )
{
swap = array[c];
array[c] = array[position];
array[position] = swap;
}
}

printf(“Sorted list in ascending order:\n”);

for ( c = 0 ; c < n ; c++ )
printf(“%d\n”, array[c]);

getch();
}

[/message_box]
[/sociallocker-bulk-1]

About Utpal

I am third year student of computer engineering in L.D COLLEGE OF ENGINEERING,Ahmedabad.

Check Also

Independent Directed Acyclic Graphs for Resilient Multipath Routing

ABSTRACT: In order to achieve resilient multipath routing, we introduce the concept of independent directed …

Leave a Reply

Be the First to Comment!

Notify of
wpDiscuz