示例#1
0
文件: main.cpp 项目: seungzzang/alg
int main ( void )
{
	int dataSet1[] = {6, 4, 2, 3, 1, 5, 11, 2, 3, 134};
	int dataSet5[] = {5, 3, 7, 6, 2, 1, 4};
	int dataSet3[] = {1, 4, 2, 3};
	int dataSet2[] = {2, 3, 4, 1};
	int dataSet4[] = {1, 2, 3, 4, 5, 6, 7, 8, 100, 99};

	int dataLen;

#define _MERGE_SORT_ 1
#define _QUICK_SORT_ 0

#if (_QUICK_SORT_)
	dataLen = sizeof(dataSet2) / sizeof(int);
	sort_test( quicksort, dataSet2, dataLen );

	dataLen = sizeof(dataSet1) / sizeof(int);
	sort_test( quicksort, dataSet1, dataLen );

	dataLen = sizeof(dataSet3) / sizeof(int);
	sort_test( quicksort, dataSet3, dataLen );

	dataLen = sizeof(dataSet4) / sizeof(int);
	sort_test( quicksort, dataSet4, dataLen );

	dataLen = sizeof(dataSet5) / sizeof(int);
	sort_test( quicksort, dataSet5, dataLen );
#elif (_MERGE_SORT_)
	dataLen = sizeof(dataSet2) / sizeof(int);
	sort_test( mergesort, dataSet2, dataLen );

	dataLen = sizeof(dataSet1) / sizeof(int);
	sort_test( mergesort, dataSet1, dataLen );

	dataLen = sizeof(dataSet3) / sizeof(int);
	sort_test( mergesort, dataSet3, dataLen );

	dataLen = sizeof(dataSet4) / sizeof(int);
	sort_test( mergesort, dataSet4, dataLen );

	dataLen = sizeof(dataSet5) / sizeof(int);
	sort_test( mergesort, dataSet5, dataLen );
#endif

	return 0;
}
示例#2
0
int main(void)
{
    /* 初始化测试数据 */
    int i, j, n;
    srand((unsigned)time(NULL));
    if (TESTN)              
        n = TESTN;
    else
        scanf("%d\n", &n);
    for (i = 0; i < n; i++)
    {
        if (TESTN)
            LIST[0][i] = rand() % MAX_N;
        else
            scanf("%d", &LIST[0][i]);
        for (j = 1; j < 7; j ++)
            LIST[j][i] = LIST[0][i];
    }

    if (DEBUG) output(LIST[0], n); //debug output

    /* 开始测试排序算法 */
    sort_test(LIST[0], 0, n-1, insertion_sort);   /* O(n^2),比较大赛据时建议注释 */
    sort_test(LIST[1], 0, n-1, merge_sort);
    sort_test(LIST[2], 0, n-1, heap_sort);
    sort_test(LIST[3], 0, n-1, quick_sort);
    sort_test(LIST[4], 0, n-1, counting_sort);
    sort_test(LIST[5], 0, n-1, radix_sort);
    sort_test(LIST[6], 0, n-1, bucket_sort);      /* 数据量大的时候有问题 */
    return 0;
}
示例#3
0
int main()
{
    empty_tests();
    qbk_tests();
    sort_test();
    multiple_list_test();
    equality_tests();

    return boost::report_errors();
}
示例#4
0
int main()
{
	/*io_test();
	file_test();
	data_test();
	list_test();*/
	
	sort_test();
	
	return EXIT_SUCCESS;
}
int main()
{
    rotate_test();
    rotate_copy_test();
    random_shuffle_test();
    partition_test();
    stable_partition_test();
    sort_test();
    stable_sort_test();
    partial_sort_test();
    return boost::report_errors();
}
示例#6
0
int main()
{
	multi_file_test();

	vector_test();
	list_test();
	deque_test();
	adapter_test();
	sort_test();
	string_test();
	return 0;
}
示例#7
0
int main(int argc, char* argv[]) {
  int failct = 0;
  failct += append_size_test();
  failct += append_apply_test();
  failct += remove_size_test();
  failct += remove_value_test();
  failct += reverse_test();
  failct += sort_test();
  if(failct == 0){
    printf("All tests successful.\n");
  }else{
    printf("Some tests did not pass successfully.\n");
  }
}
示例#8
0
int main(){
    char str[10] = "hello";
    hello_world();

    n_hello_world(5);

    printf("len=%d\n", w_strlen("hello world"));

    change_str_test();

    printf("222 %s\n", reverse(str));

    concat_test();

    customer_manager();

    sort_test();

    return 0;
}
示例#9
0
文件: test.c 项目: hongtinh/HTLIBS
int main()
{
  //tree_test();
	sort_test();
  return 0;
}
示例#10
0
int test_list()
{
    if (sort_test()) return 1;

    List<A> a_list;
    a_list.add(A(1, 2));
    a_list.add(A(2, 3));
    a_list.add(A(3, 4));
    CHECK(a_list.get_item_count() == 3);
    CHECK(a_list.contains(A(2, 3)));
    CHECK(!a_list.contains(A(7, 8)));

    A a;
    CHECK(YETI_SUCCEEDED(a_list.pop_head(a)));
    CHECK(a == A(1, 2));
    CHECK(a_list.get_item_count() == 2);
    CHECK(YETI_SUCCEEDED(a_list.get(0, a)));
    CHECK(a == A(2, 3));

    A * pa = NULL;
    CHECK(YETI_SUCCEEDED(a_list.get(0, pa)));
    CHECK(pa != NULL);
    CHECK(*pa == A(2, 3));
    CHECK(a_list.get_item(1) == ++a_list.get_first_item());

    a_list.clear();
    CHECK(a_list.get_item_count() == 0);
    a_list.insert(a_list.get_first_item(), A(7, 9));
    CHECK(a_list.get_item_count() == 1);
    CHECK(*a_list.get_first_item() == A(7, 9));

    a_list.add(A(1, 2));
    CHECK(a_list.get_item_count() == 2);
    //CHECK(g_count == 3);
    CHECK(*a_list.get_first_item() == A(7, 9));
    CHECK(*a_list.get_last_item() == A(1, 2));

    a_list.insert(a_list.get_last_item(), A(3, 4));
    CHECK(a_list.get_item_count() == 3);
    CHECK(*a_list.get_last_item() == A(1, 2));

    g_apply_counter = 0;
    bool applied;
    YETI_Result res = a_list.apply_until(Test1(), UnitlResultEquals(YETI_ERROR_OUT_OF_MEMORY), &applied);
    CHECK(applied == true);
    CHECK(res == YETI_SUCCESS);
    CHECK(g_apply_counter == 2);

    g_apply_counter = 0;
    res = a_list.apply_until(Test1(), UnitlResultEquals(YETI_FAILURE), &applied);
    CHECK(applied == false);
    CHECK(res == YETI_SUCCESS);
    CHECK(g_apply_counter == 3);

    a_list.insert(List<A>::iterator(NULL), A(3, 4));
    CHECK(a_list.get_item_count() == 4);
    CHECK(*a_list.get_last_item() == A(3, 4));

    a_list.insert(a_list.get_first_item(), A(7, 8));
    CHECK(a_list.get_item_count() == 5);
    CHECK(*a_list.get_first_item() == A(7, 8));

    a_list.insert(a_list.get_item(2), A(9, 10));
    CHECK(a_list.get_item_count() == 6);
    CHECK(*a_list.get_item(2) == A(9, 10));

    a_list.erase(a_list.get_item(1));
    CHECK(a_list.get_item_count() == 5);
    CHECK(*a_list.get_item(1) == A(9, 10));
    //CHECK(g_count == 1 + a_list.get_item_count());

    List<int> i1_list;
    List<int> i2_list;
    CHECK(i1_list == i2_list);
    i1_list.add(3);
    CHECK(i1_list != i2_list);
    CHECK(!(i1_list == i2_list));
    i2_list.add(3);
    CHECK(i1_list == i2_list);
    i2_list.add(4);
    CHECK(i1_list != i2_list);
    i1_list.add(4);
    i1_list.add(5);
    i2_list.add(6);
    CHECK(i1_list != i2_list);

    return 0;
}