#include <stdio.h>
 
 #include <math.h>
 
 
 
 int main()
 
 {
 
     int a[] = {16, 19, 11, 15, 10, 12, 14};
 
     int i,j;
 
 
 
     i = 0;
 
     while (i<7)
 
     {
 
 
 
         //finding the smallest number in the subarray
 
         int index_of_smallest = i;
 
         for(j=i; j<7; j++)
 
         {
 
             if (a[j]<a[index_of_smallest])
 
                 index_of_smallest = j;
 
         }
 
 
 
         //swapping
 
         int temp = a[i];
 
         a[i] = a[index_of_smallest];
 
         a[index_of_smallest] = temp;
 
 
 
         i++;
 
     }
 
 
 
     for(i=0;i<7;i++)
 
         printf("%d\n",a[i]);
 
 
 
     return 0;
 
 }

 void selectSort(int arr[], int n)
 
 {
 
 //pos_min is short for position of min
 
 	int pos_min,temp;
 
 
 
 	for (int i=0; i < n-1; i++)
 
 	{
 
 	    pos_min = i;//set pos_min to the current index of array
 
 		
 
 		for (int j=i+1; j < n; j++)
 
 		{
 
 
 
 		if (arr[j] < arr[pos_min])
 
                    pos_min=j;
 
 	//pos_min will keep track of the index that min is in, this is needed when a swap happens
 
 		}
 
 		
 
 	//if pos_min no longer equals i than a smaller value must have been found, so a swap must occur
 
             if (pos_min != i)
 
             {
 
                  temp = arr[i];
 
                  arr[i] = arr[pos_min];
 
                  arr[pos_min] = temp;
 
             }
 
 	}
 
 }