C program to sort elements of an array using selection sort

In this article we will learn to implement a C program to sort elements of an array using selection sort. A C program is provided below which reads a list of numbers and prints the sorted list of numbers using selection sort algorithm.

Program is as follows:

//C program to sort an array of elements using selection sort
#include<stdio.h>
#include<conio.h>
void main()
{
	int a[6], minpos, i, j, temp;
	printf("Enter 6 numbers: ");
	for(i=0; i<6; i++)
		scanf("%d", &a[i]);
	for(i=0; i<6; i++)
	{
		minpos = i;
		for(j=i+1; j<6; j++)
		{
			if(a[minpos] > a[j])
				minpos = j;
		}
		temp = a[minpos];
		a[minpos] = a[i];
		a[i] = temp;
	}
	printf("After sorting, array elements are: ");
	for(i=0; i<6; i++)
		printf("%d ", a[i]);
	getch();
}

Input and output for the above program is as follows:

Enter 6 numbers: 5 3 1 2 6 4
After sorting, array elements are: 1 2 3 4 5 6

Suryateja Pericherla

Suryateja Pericherla, at present is a Research Scholar (full-time Ph.D.) in the Dept. of Computer Science & Systems Engineering at Andhra University, Visakhapatnam. Previously worked as an Associate Professor in the Dept. of CSE at Vishnu Institute of Technology, India.

He has 11+ years of teaching experience and is an individual researcher whose research interests are Cloud Computing, Internet of Things, Computer Security, Network Security and Blockchain.

He is a member of professional societies like IEEE, ACM, CSI and ISCA. He published several research papers which are indexed by SCIE, WoS, Scopus, Springer and others.