int main(void) {
test_no_op();
test_simple();
test_percentile();
test_merge();
return 0;
}
void test_function (size_t size, rng_t & rng)
{
Carrier carrier(size, merge_callback);
random_init(carrier, rng);
Example example(carrier);
remove_deps(carrier, example.fun);
test_merge(carrier, rng);
remove_deps(carrier, example.fun);
}
int main()
{
auto empty = std::vector<int> {};
auto singleton = std::vector<int> { 1 };
auto doubleton = std::vector<int> { 1, 2 };
auto random = std::vector<int> { 5, 1, 3, 4, 8, 7, 2, 9, 0, 6 };
auto sorted = std::vector<int> { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
auto reversed = std::vector<int> { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 };
auto nearly_sorted = std::vector<int> { 0, 1, 3, 2, 4, 5, 7, 6, 8, 9 };
auto few_unique = std::vector<int> { 0, 1, 2, 0, 1, 2, 0, 1, 2, 0 };
auto inputs = std::vector<std::vector<int>> { empty, singleton, doubleton, random, sorted, reversed, nearly_sorted, few_unique };
clock_t t;
t = clock();
test_selection(begin(inputs), end(inputs));
t = clock() - t;
double time_taken = ((double)t)/CLOCKS_PER_SEC; // in seconds
printf("selection_sort took %f seconds to execute \n\n", time_taken);
t = clock();
test_insertion(begin(inputs), end(inputs));
t = clock() - t;
time_taken = ((double)t)/CLOCKS_PER_SEC; // in seconds
printf("insertion_sort took %f seconds to execute \n\n", time_taken);
t = clock();
test_quick(begin(inputs), end(inputs));
t = clock() - t;
time_taken = ((double)t)/CLOCKS_PER_SEC; // in seconds
printf("quick_sort took %f seconds to execute \n\n", time_taken);
t = clock();
test_merge(begin(inputs), end(inputs));
t = clock() - t;
time_taken = ((double)t)/CLOCKS_PER_SEC; // in seconds
printf("merge_sort took %f seconds to execute \n\n", time_taken);
t = clock();
test_heap(begin(inputs), end(inputs));
t = clock() - t;
time_taken = ((double)t)/CLOCKS_PER_SEC; // in seconds
printf("heap_sort took %f seconds to execute \n\n", time_taken);
}
void test(){
test_sum();
test_max();
test_min();
test_second_max();
test_second_min();
test_equal();
test_occurences();
test_countNegatives();
test_indexOf();
test_clearWith();
test_insertElement();
test_removeElement();
test_copy();
test_merge();
test_reverse();
test_sort();
printf("All passed!!!!");
}
int tests_List_merge(int test_number)
{
int n_tests = 11;
// If test_number is out of range, then...
if(test_number < 0 || test_number >= n_tests)
return n_tests; // return how many distinct test-cases we have.
switch(test_number) {
case 0: return test_merge(NULL, NULL, strcmp_forward);
case 1: return test_merge(make_list(0), NULL, strcmp_forward);
case 2: return test_merge(NULL, make_list(0), strcmp_forward);
case 3: return test_merge(make_list(0), make_list(1), strcmp_forward);
case 4: return test_merge(make_list(0), make_list(1), strcmp_reverse);
case 5: return test_merge(make_list(2), make_list(3), strcmp_forward);
case 6: return test_merge(make_list(2), make_list(3), strcmp_reverse);
case 7: return test_merge(make_list(2), make_list(3), strcmp_int);
case 8: return test_merge(make_list(4), make_list(5), strcmp_forward);
case 9: return test_merge(make_list(4), make_list(5), strcmp_reverse);
case 10: return test_merge(make_list(6), make_list(7), strcmp_length);
}
return FALSE;
}
void test_main(void) {
test_clone();
test_merge();
}
