请将以上代码完整转换成C语言代码

下面是将给定的Python代码转换为C语言代码的例子：

#include <stdio.h>
#include <stdlib.h>

int min_swaps_to_sort(int arr[], int n) {
    int correct_positions[n];
    for (int i = 0; i < n; i++) {
        correct_positions[i] = i;
    }
    
    for (int i = 1; i < n; i++) {
        int max_index = i;
        for (int j = i + 1; j < n; j++) {
            if (arr[j] > arr[max_index]) {
                max_index = j;
            }
        }
        correct_positions[i] = max_index;
    }

    int swaps = 0;
    for (int i = 0; i < n; i++) {
        if (i != correct_positions[i]) {
            int new_max_index = i;
            for (int j = i + 1; j < correct_positions[i]; j++) {
                if (arr[j] > arr[new_max_index]) {
                    new_max_index = j;
                }
            }
            swaps += correct_positions[i] - (new_max_index + 1);
            int temp = arr[i];
            arr[i] = arr[new_max_index];
            arr[new_max_index] = temp;
        }
    }
    
    return swaps;
}

int main() {
    int test_cases[] = {2, 3, 8, 6, 1, 0};
    int tests_count = sizeof(test_cases) / sizeof(test_cases[0]);
    
    for (int i = 0; i < tests_count; i++) {
        printf("For array with %d elements: ", test_cases[i]);
        int result = min_swaps_to_sort(test_cases + i, test_cases[i] + 1);
        printf("Minimum swaps required: %d\n", result);
    }

    return 0;
}

这段C代码实现了与Python版本类似的功能，计算最小交换次数以排序数组。请注意，C语言中没有内置的列表数据结构，所以我使用了数组，并相应地调整了代码结构。同时，C语言中的主函数`main()`用于测试提供的测试案例。