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

int _test_merge_sort_large_array() {
    mu_start();
    //────────────────────
    // for this test, could even randomly generate the array
    int input_array[]     = { 1, 6, 3, 78, 3, 1, 4 };
    int expected_array[]  = { 1, 1, 3, 3, 4, 6, 78 };
    int size = sizeof(input_array) / sizeof(*input_array);

    merge_sort_array(merge_sort_array, size);

    for (int i = 0; i < size; i++) {
        // could print the failing index, because its hard to tell
        // with mu_checks in a loop which failed
        if (input_array[i] != expected_array[i]) {
            printf("Failed at index %d\n", i);
        }
        mu_check(input_array[i] == expected_array[i]);
    }
    // alternatively, just print out the arrays

    //────────────────────
    mu_end();
}

int _test_compare_array_sort_merge_vs_tree() {
    mu_start();
    //────────────────────
    // for this test, could even randomly generate the array
    int merge_sort_array[] = { 1, 6, 3, 78, 3, 1, 4 };
    int tree_sort_array[]  = { 1, 6, 3, 78, 3, 1, 4 };
    int size = sizeof(merge_sort_array) / sizeof(*merge_sort_array);

    // this is only a useful test if at least one of them are valid
    merge_sort_array(merge_sort_array, size);
    tree_sort_array(tree_sort_array, size);

    for (int i = 0; i < size; i++) {
        // could print the failing index, because its hard to tell
        // with mu_checks in a loop which failed
        if (merge_sort_array[i] != tree_sort_array[i]) {
            printf("Failed at index %d\n", i);
        }
        mu_check(merge_sort_array[i] == tree_sort_array[i]);
    }
    // alternatively, just print out the arrays

    //────────────────────
    mu_end();
}

int main(int argc, char* argv[]) {
    
    return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */