90 sort<int, C>(arrayToSort, length, comparator, idempotent); |
90 sort<int, C>(arrayToSort, length, comparator, idempotent); |
91 return compare_arrays(arrayToSort, expectedResult, length); |
91 return compare_arrays(arrayToSort, expectedResult, length); |
92 } |
92 } |
93 |
93 |
94 bool QuickSort::test_quick_sort() { |
94 bool QuickSort::test_quick_sort() { |
|
95 #if 0 |
95 tty->print_cr("test_quick_sort\n"); |
96 tty->print_cr("test_quick_sort\n"); |
96 { |
97 { |
97 int* test_array = NULL; |
98 int* test_array = NULL; |
98 int* expected_array = NULL; |
99 int* expected_array = NULL; |
99 assert(sort_and_compare(test_array, expected_array, 0, test_comparator), "Empty array not handled"); |
100 assert(sort_and_compare(test_array, expected_array, 0, test_comparator), "Empty array not handled"); |