C Program to implement Selection sort

Levels of difficulty: / perform operation:

Write a C program to sort given N elements using SELECTION sort method using functions :
a) To find maximum of elements
b) To swap two elements

Selection sort is comparison based sorting technique, It finds the minimum value in list and swaps that value to the first position and so on. Selection sort is inefficient on larger data.

C Program

#include <stdio.h>
#include <conio.h>
void main() {
	int array[10];
	int i, j, N, temp;
	int findmax(int b[10], int k);
	/* function declaration */
	void exchang(int b[10], int k);
	printf("Enter the value of N\n");
	printf("Enter the elements one by one\n");
	for (i=0; i<N ; i++) {
	printf("Input array elements\n");
	for (i=0; i<N ; i++) {
	/* Selection sorting begins */
	printf("Sorted array is...\n");
	for (i=0; i< N ; i++) {
/* End of main*/
/* function to find the maximum value */
int findmax(int b[10], int k) {
	int max=0,j;
	for (j = 1; j <= k; j++) {
		if ( b[j] > b[max]) {
			max = j;
void exchang(int b[10],int k) {
	int  temp, big, j;
	for ( j=k-1; j>=1; j--) {
		big = findmax(b,j);
		temp = b[big];
		b[big] = b[j];
		b[j] = temp;