selection_sort.c

/* selection sort implementation in C */
#include<stdio.h>

/* swapping two elements by reference */  
void swap(int *a,int *b)
{
	int temp;
	temp = *a;
	*a = *b;
	*b = temp;
}

/* print array */
void printArray(int A[], int N)
{
	int i=0;
	for (i = 0; i < N; ++i)
	{
		printf("%d ",A[i]);
	}
}

/* selection sort */ 
void selectionSort(int A[], int N)
{
	int i,j,minI;
    for (i = 0; i < N-1; ++i)
    {
    	/* finding min index minI*/
    	minI=i;
    	for (j = i+1; j < N; ++j)
    	{
    		
    		if (A[minI] > A[j])
    			minI=j;
    	}
    	/*swapping with the min*/
    	swap(&A[i],&A[minI]);
    }
}


int main()
{
	int T,N;
	int i,j;
	int A[200];
	scanf("%d",&T);
	for (i=0; i < T; ++i)		
	{
	   scanf("%d",&N);
       for(j=0; j < N; ++j)
       {
       	  scanf("%d",&A[j]);		
       } 
  	   selectionSort(A,N);
       printArray(A,N);
       printf("\n");
	}
	return 0;
}