Write a C Program to implement the concept of Selection Sort

Program:-

#include<stdio.h>
void selectionsort(int a[],int size);
main()
{
int i,j,size;
printf("Enter number of elements\n");
scanf("%d",&size);
int a[size];
printf("Enter numbers\n");
for(i=0;i<size;i++)
{
scanf("%d",&a[i]);

}
selectionsort(a,size);
printf("Ascending order of given numbers is\n");
for(i=0;i<size;i++)
{
printf("%d\n",a[i]);

}

}
void selectionsort(int a[],int size)
{
int temp,i,j,pointer;
for(i=0;i<size-1;i++)
{
pointer=i;
for(j=i+1;j<size;j++)
{
if(a[pointer]>a[j])
{
pointer=j;

}
if(pointer!=i)
{
temp=a[pointer];
a[pointer]=a[i];
a[i]=temp;

}

}

}

}

Output:-

Enter number of elements
5
Enter numbers
5
4
3
2
1
Ascending order of given numbers is
1
2
3
4
5