Pure Selection Sort in C

pure_selection_sort.c

/* Selection Sort Algorithm */

#include <stdio.h>

int main() {
    
    int i, j;
    int min, temp;
    int c = 0, s = 0;
    int n;
    scanf("%d", &n);
    int arr[n];
    
    for(i = 0; i < n; i++)
        scanf("%d", &arr[i]);

    for (i = 0; i < n; i++) {
        min = i;
        for (j = i + 1; j < n; j++) {
            c++;
            if(arr[j] < arr[min]) {
                min = j;
            }
        }
        s++;
        /* Swapping */
        temp = arr[min];
        arr[min] = arr[i];
        arr[i] = temp;
    }

    for (i = 0; i < n; i++)
        printf("%d ", arr[i]);
    
    printf("\n%d\n%d", c, s-1);

    return 0;
}