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.
[nextpage title=”Program” ]
[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]
[/nextpage]
[nextpage title=”Output” ]
[message_box title=”Output” color=”green”]
Enter number of elements
8
Enter 10 integers
12
6
5
9
13
20
2
10
Sorted list in ascending order:
2
5
6
9
10
12
13
20
[/message_box]
[/nextpage]
