ex33 with my impl for bubble/merge sorts

lcthw-remnants-2/liblcthw/tests/lcthw/list_algos_tests.c

@@ -0,0 +1,97 @@
+#undef NDEBUG
+#include "../minunit.h"
+#include <lcthw/list_algos.h>
+#include <assert.h>
+#include <string.h>
+
+char *values[] = {"XXXX", "1234", "abcd", "xjvef", "NDSS"};
+#define NUM_VALUES 5
+
+List *create_words()
+{
+  int i = 0;
+  List *words = List_create();
+
+  for(i = 0; i < NUM_VALUES; i++) {
+    List_push(words, values[i]);
+  }
+
+  return words;
+}
+
+int is_sorted(List *words)
+{
+  LIST_FOREACH(words, first, next, cur) {
+    if(cur->next && strcmp(cur->value, cur->next->value) > 0) {
+      debug("%s %s", (char *)cur->value, (char *)cur->next->value);
+      return 0;
+    }
+  }
+
+  return 1;
+}
+
+char *test_bubble_sort()
+{
+  List *words = create_words();
+
+  // should work on a list that needs sorting
+  int rc = List_bubble_sort(words, (List_compare)strcmp);
+  mu_assert(rc == 0, "Bubble sort failed.");
+  mu_assert(is_sorted(words), "Words are not sorted after bubble sort.");
+
+  // should work on an already sorted list
+  rc = List_bubble_sort(words, (List_compare)strcmp);
+  mu_assert(rc == 0, "Bubble sort of already sorted failed.");
+  mu_assert(is_sorted(words), "Words should be sorted if already bubble sorted.");
+
+  List_destroy(words);
+
+  // should work on an empty list
+  words = List_create();
+  rc = List_bubble_sort(words, (List_compare)strcmp);
+  mu_assert(rc == 0, "Bubble sort failed on empty list.");
+  mu_assert(is_sorted(words), "Words should be sorted if empty.");
+
+  List_destroy(words);
+
+  return NULL;
+}
+
+char *test_merge_sort()
+{
+  List *words = create_words();
+
+  // should work on a list that needs sorting
+  List *res = List_merge_sort(words, (List_compare)strcmp);
+  mu_assert(List_count(res) == List_count(words), "Sorted list has different count.");
+  mu_assert(is_sorted(res), "Words are not sorted after merge sort.");
+
+  List *res2 = List_merge_sort(res, (List_compare)strcmp);
+  mu_assert(List_count(res2) == List_count(res), "Sorted list has different count.");
+  mu_assert(is_sorted(res), "Should still be sorted after merge sort.");
+
+  List_destroy(res2);
+  List_destroy(res);
+
+  List_destroy(words);
+  return NULL;
+}
+
+
+char *all_tests()
+{
+  mu_suite_start();
+
+  int i = 0;
+  for(i = 0; i < NUM_VALUES; i++) {
+    printf("%s -> %p\n", values[i], values[i]);
+  }
+
+  mu_run_test(test_bubble_sort);
+  mu_run_test(test_merge_sort);
+
+  return NULL;
+}
+
+RUN_TESTS(all_tests);