16 int a_val = *((
int*)a);
17 int b_val = *((
int*)b);
21 }
else if (a_val > b_val) {
45 data_perm = (
int*)malloc(
sizeof(
int) * 2 * n);
46 for (i = 0; i < n; i++) {
47 data_perm[2 * i] = data[i];
48 data_perm[2 * i + 1] = i + 1;
51 for (i = 0; i < n; i++) {
52 data[i] = data_perm[2 * i];
53 perm[i] = data_perm[2 * i + 1];
int pair_compare(const void *a, const void *b)
Helper function for integer_sort_c()
int integer_sort_c(int n, int *data, int *perm)
Sort the given data array and return the permutation.