reimplement compare function for quicksort

2026-05-15 23:24:04 -05:00
parent f186ebfca8
commit 861088152f
4 changed files with 18 additions and 11 deletions
--- a/test/test.c
+++ b/test/test.c
@@ -75,11 +75,15 @@ int test_radix_sort() {
    return return_code;
 }

+int test_compare_function(lsort_item* a, lsort_item* b) {
+    return a->key - b->key;
+}
+
 int test_quicksort() {
    printf("lsort_quicksort()...\n");
    
    lsort_array* array_quicksort = generate_samples(sample_count);
-    int return_code = lsort_quicksort(array_quicksort);
+    int return_code = lsort_quicksort(array_quicksort, test_compare_function);

    lsort_array_destroy(array_quicksort, 1);
    return return_code;