using namespace timely;
using namespace unit_test;
-const int MAX_ELEMENTS = 30;
-//1200
+const int MAX_ELEMENTS = 1200;
const int MAX_VALUE = 28000;
: application_shell()
{
}
+
DEFINE_CLASS_NAME("test_sorts")
- ;
int *populate_random_c_array(int size);
basis::array<int> populate_random_array(int size);
+ void rerandomize(int list[], int size);
+ bool verify_ascending(const int *list, int size);
+ bool verify_descending(const int *list, int size);
- void test_shell_sort(int *list, int size);
- void test_heap_sort(int *list, int size);
- void test_merge_sort(basis::array<int> &list);
+ void test_shell_sort(int size);
+ void test_heap_sort(int size);
+ void test_merge_sort(int size);
+ void test_quick_sort(int size);
virtual int execute();
};
return to_return;
}
-//hmmm: this pattern is very silly. it's nearly cookie cutter, so why not implement a templated version?
-// one diff is the C array versus basis array usage.
+void test_sorts::rerandomize(int list[], int size)
+{
+ for (int i = 0; i < size; i++)
+ list[i] = randomizer().inclusive(0, MAX_VALUE);
+}
-void test_sorts::test_shell_sort(int *list, int size)
+bool test_sorts::verify_ascending(const int *list, int size)
+{
+ FUNCDEF("verify_ascending")
+ int last = list[0];
+ for (int j = 1; j < size; j++) {
+ if (list[j] < last) return false;
+ last = list[j];
+ }
+ return true;
+}
+
+bool test_sorts::verify_descending(const int *list, int size)
+{
+ FUNCDEF("verify_descending")
+ int last = list[0];
+ for (int j = 1; j < size; j++) {
+ if (list[j] > last) return false;
+ last = list[j];
+ }
+ return true;
+}
+
+void test_sorts::test_shell_sort(int size)
{
FUNCDEF("test_shell_sort");
+ int *list = populate_random_c_array(size);
+
// check a normal sort.
shell_sort(list, size);
- int last = -1;
- for (int j = 0; j < size; j++) {
- ASSERT_FALSE(list[j] < last, "ordering check - list should be ordered at first check");
- last = list[j];
- }
+ ASSERT_TRUE(verify_ascending(list, size),
+ "ordering check - list should be ordered at first check");
- // re-randomize the list.
- for (int i = 0; i < size; i++)
- list[i] = randomizer().inclusive(0, MAX_VALUE);
+ rerandomize(list, size);
// check a reversed sort.
shell_sort(list, size, true);
- last = MAX_VALUE + 100; // past the maximum we'll include in the list.
- for (int j = 0; j < size; j++) {
- ASSERT_FALSE(list[j] > last, "ordering check - list should be ordered at second check");
- last = list[j];
- }
+ ASSERT_TRUE(verify_descending(list, size),
+ "ordering check - list should be ordered at second check");
// clean up now.
delete[] list;
}
-void test_sorts::test_heap_sort(int *list, int size)
+void test_sorts::test_heap_sort(int size)
{
FUNCDEF("test_heap_sort");
+ int *list = populate_random_c_array(size);
+
// check a normal sort.
heap_sort(list, size);
+ ASSERT_TRUE(verify_ascending(list, size),
+ "ordering check - list should be ordered at first check");
- int last = -1;
- for (int j = 0; j < size; j++) {
- ASSERT_FALSE(list[j] < last, "ordering check - list should be ordered at first check");
- last = list[j];
- }
-
- // re-randomize the list.
- for (int i = 0; i < size; i++)
- list[i] = randomizer().inclusive(0, MAX_VALUE);
+ rerandomize(list, size);
// check a reversed sort.
heap_sort(list, size, true);
-
- last = MAX_VALUE + 100; // past the maximum we'll include in the list.
- for (int j = 0; j < size; j++) {
- ASSERT_FALSE(list[j] > last, "ordering check - list should be ordered at second check");
- last = list[j];
- }
+ ASSERT_TRUE(verify_descending(list, size),
+ "ordering check - list should be ordered at second check");
// clean up now.
delete[] list;
}
-void test_sorts::test_merge_sort(basis::array<int> &list)
+void test_sorts::test_merge_sort(int size)
{
FUNCDEF("test_merge_sort");
+ basis::array<int> list = populate_random_array(size);
+
// check a normal sort.
basis::array<int> ret = merge_sort(list);
-// LOG(a_sprintf("list has %d elems", ret.length()));
// LOG(astring("list has ") + dump_list(ret.observe(), ret.length()));
- int last = -1;
- for (int j = 0; j < list.length(); j++) {
- ASSERT_FALSE(ret[j] < last, "ordering check - list should be ordered at first check");
- last = ret[j];
- }
+ ASSERT_TRUE(verify_ascending(ret.access(), size),
+ "ordering check - list should be ordered at first check");
- // re-randomize the list.
- for (int i = 0; i < list.length(); i++)
- list[i] = randomizer().inclusive(0, MAX_VALUE);
+ rerandomize(list.access(), size);
// check a reversed sort.
ret = merge_sort(list, true);
+ ASSERT_TRUE(verify_descending(ret.access(), size),
+ "ordering check - list should be ordered at second check");
+}
- last = MAX_VALUE + 100; // past the maximum we'll include in the list.
- for (int j = 0; j < list.length(); j++) {
- ASSERT_FALSE(ret[j] > last, "ordering check - list should be ordered at second check");
- last = ret[j];
- }
+void test_sorts::test_quick_sort(int size)
+{
+ FUNCDEF("test_quick_sort");
+
+ int *list = populate_random_c_array(size);
+
+ // check a normal sort.
+ quick_sort(list, size);
+ ASSERT_TRUE(verify_ascending(list, size),
+ "ordering check - list should be ordered at first check");
+
+// LOG(a_sprintf("after quick sort: %s", dump_list(list, size).s()));
+
+ rerandomize(list, size);
+
+ // check a reversed sort.
+ quick_sort(list, size, true);
+ ASSERT_TRUE(verify_descending(list, size),
+ "ordering check - list should be ordered at second check");
+
+ // clean up now.
+ delete[] list;
}
+
int test_sorts::execute()
{
FUNCDEF("execute");
int size = MAX_ELEMENTS;
- test_shell_sort(populate_random_c_array(size), size);
-
- test_heap_sort(populate_random_c_array(size), size);
+ test_shell_sort(size);
- basis::array<int> testarray = populate_random_array(size);
- test_merge_sort(testarray);
+ test_heap_sort(size);
- // test_quick_sort(populate_random_array(size), size);
+ test_merge_sort(size);
+ test_quick_sort(size);
return final_report();
}
projects / feisty_meow.git / blobdiff