[Algorithms(C)] selection-sort

code

#include <stdio.h>

int arr[10] = {3, 1, 4, 2, 8, 5, 7, 9, 6, 0};

int main(void)
{
    for(int i = 0; i < 9; i++)
    {
        int idx=i, j=0, temp=0;
        for(j = i+1; j < 10; j++)
        {
            if(arr[idx] > arr[j])
                idx = j;
        }
        
        temp = arr[i];
        arr[i] = arr[idx];
        arr[idx] = temp;

        printf("%d, %d, %d, %d, %d, %d, %d, %d, %d, %d\n", 
        arr[0], arr[1], arr[2], arr[3], arr[4], arr[5], arr[6], arr[7], arr[8], arr[9]);        
    }
}
    

---

functioning

---