// C program for implementation of selection sort
#include <stdio.h>

// Driver program to test above functions
int main()
{
    int arr[] = {1,0,1,1,6,2,1,3};
    int n = 8;
    int i, j, min_idx;

    // One by one move boundary of unsorted subarray
    for (i = 0; i < n-1; i++)
    {
        for (int g=0; g < n; g++)
            printf("%d ", arr[g]);
        printf("\n");

        // Find the minimum element in unsorted array
        min_idx = i;
        for (j = i+1; j < n; j++)
          if (arr[j] < arr[min_idx])
            min_idx = j;

        // Swap the found minimum element with the first element
        int temp = arr[min_idx];
        arr[min_idx] = arr[i];
        arr[i] = temp;
    }

    for (int g=0; g < n; g++)
        printf("%d ", arr[g]);
    printf("\n");
    return 0;
}