#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>
#include "clog.h"

void print_ints(int* array_of_ints, size_t num_ints) {
    for(int i = 0; i < num_ints; i++) {
        printf("%d ", array_of_ints[i]);
    }
    printf("\n");
}

int compare_ints(const void* a_n1, const void* a_n2) {
    const int* a_n1_int = a_n1;
    const int* a_n2_int = a_n2;
    int n1 = *a_n1_int;
    int n2 = *a_n2_int;
    log_yellow("compare_ints(%d, %d);\n", n1, n2);
    if(n1 < n2) {
        return -1;
    }
    else if(n1 == n2) {
        return 0;
    }
    else {
        assert(n1 > n2);
        return 1;
    }
}

int main(int argc, char* argv[]) {

    int array[] = { 2, 1, 3};
    print_ints(array, 3);
    qsort(array, 3, sizeof(array[0]), compare_ints);
    print_ints(array, 3);

    return EXIT_SUCCESS;
}
// void qsort(void *base, size_t nmemb, size_t size,
//            int (*compar)(const void *, const void *));

/*
 * The comparison function must return an integer less than, equal to,  or  greater  than
 * zero  if  the  first argument is considered to be respectively less than, equal to, or
 * greater than the second.  If two members compare as equal, their order in  the  sorted
 * array is undefined.
 */
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */