one algorithm a day keeps the doctor away -- SelectionSort

#include<stdio.h>
int main()
{
    void SectSort(int array[],int n);
    int array[10] = {12,5,2,78,9658,39,210,156,13,11};
    SectSort(array,10);
    for(int iter = 0;iter < 10;iter ++)
    {
        printf("%d ",array[iter]);
    }
    return 0;
}

void SectSort(int array[],int n)
{
    for(int iter = 0;iter < n - 1;iter ++)
    {
        int flag = iter;
        int temp;
        int min_element = array[iter];
        for(int jter = iter;jter < n;jter ++)
        {
            if(array[jter] < min_element)
            {
                min_element = array[jter];
                flag = jter;
            }
        }
        temp = array[iter];
        array[iter] = array[flag];
        array[flag] = temp;

    }
}