Selection sort algorithm implementation in c
#include <stdio.h>
#include<conio.h>
void main()
{
int array[100], n, i, j, position, swap;
clrscr();
printf("Enter number of elements\n");
scanf("%d", &n);
printf("Enter %d integers\n", n);
for ( i = 0 ; i < n ; i++ )
scanf("%d", &array[i]);
for ( i = 0 ; i < ( n - 1 ) ; i++ )
{
position = i;
for ( j = i + 1 ; j < n ; j++ )
{
if ( array[position] > array[j] )
position = j;
}
if ( position != i )
{
swap = array[i];
array[i] = array[position];
array[position] = swap;
}
}
printf("Sorted list in ascending order:\n");
for ( i = 0 ; i < n ; i++ )
printf("%d\n", array[i]);
getch();
}
Output of program:
![](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjrwCqUiqa5mYjzFsBqFVRmD_gupKx_fj12cAtmt8GoZqVi71s_YKxcDeaarx7gCLDrtRCXes1D1Ea-8s4iRx41tXNr20z7rEn0uaB8xWPyKgKWsUUE6umdjR163gSKQ_F3YdyuBg7Of4M/s1600/Untitled.png)
No comments:
Post a Comment