C++ bubble_sort函数代码示例

int main() {
  std::vector<int> V = {1, 1, 0, 3, 4, 5, 1, 0, 5, 5, 3, 1, 2, 2, 2, 2};
  
  bubble_sort(V);
  
  printv(V);
  
  return 0;
}

void test_to_sort_the_elements_list_of_double_datatype_when_list_is_already_sorted(){
        double before_sorting[3] = {4.0,7.0,8.0};
        double after_sorting[3] = {4.0,7.0,8.0,};
        void* elements[3] = {&before_sorting[0],&before_sorting[1],&before_sorting[2]};
        bubble_sort(elements,3,compare_doubles);
        ASSERT(after_sorting[0] == *(double*)elements[0]);
        ASSERT(after_sorting[1] == *(double*)elements[1]);
        ASSERT(after_sorting[2] == *(double*)elements[2]);

};

void test_to_sort_the_elements_list_of_float_datatype_when_element_are_duplicate(){
        float before_sorting[3] = {7.0f,7.0f,4.0f};
        float after_sorting[3] = {4.0f,7.0f,7.0f};
        void* elements[3] = {&before_sorting[0],&before_sorting[1],&before_sorting[2]};
        bubble_sort(elements,3,compare_floats);
        ASSERT(after_sorting[0] == *(float*)elements[0]);
        ASSERT(after_sorting[1] == *(float*)elements[1]);
        ASSERT(after_sorting[2] == *(float*)elements[2]);

};

void test_to_sort_the_elements_list_of_int_datatype_when_element_are_duplicate(){
        int before_sorting[3] = {4,2,2};
        int after_sorting[3] = {2,2,4};
        void* elements[3] = {&before_sorting[0],&before_sorting[1],&before_sorting[2]};
        bubble_sort(elements,3,compare_ints);
        ASSERT(after_sorting[0] == *(int*)elements[0]);
        ASSERT(after_sorting[1] == *(int*)elements[1]);
        ASSERT(after_sorting[2] == *(int*)elements[2]);

};

void test_to_sort_the_elements_list_of_int_datatype_when_list_is_already_sorted(){
        int before_sorting[3] = {1,2,3};
        int after_sorting[3] = {1,2,3};
        void* elements[3] = {&before_sorting[0],&before_sorting[1],&before_sorting[2]};
        bubble_sort(elements,4,compare_ints);
        ASSERT(after_sorting[0] == *(int*)elements[0]);
        ASSERT(after_sorting[1] == *(int*)elements[1]);
        ASSERT(after_sorting[2] == *(int*)elements[2]);

};

void test_to_sort_the_elements_list_of_string_datatype_when_element_are_duplicate(){
        String before_sorting[3] = {"dddd","bbcc","bbcc"};
        String after_sorting[3] = {"bbcc","bbcc","dddd"};
        void* elements[3] = {&before_sorting[0],&before_sorting[1],&before_sorting[2]};
        bubble_sort(elements,3,compare_chars);
        ASSERT(0==strcmp(after_sorting[0],*(String*)elements[0]));
        ASSERT(0==strcmp(after_sorting[1],*(String*)elements[1]));
        ASSERT(0==strcmp(after_sorting[2],*(String*)elements[2]));

};

void test_to_sort_the_elements_list_of_char_datatype_when_element_are_duplicate(){
        char before_sorting[3] = {'d','c','c'};
        char after_sorting[3] = {'c','c','d'};
        void* elements[3] = {&before_sorting[0],&before_sorting[1],&before_sorting[2]};
        bubble_sort(elements,3,compare_chars);
        ASSERT(after_sorting[0] == *(char*)elements[0]);
        ASSERT(after_sorting[1] == *(char*)elements[1]);
        ASSERT(after_sorting[2] == *(char*)elements[2]);

};

int main(void)
{
    mylib::date dates[] = {mylib::date(1912,6,23), mylib::date(1941,9,9),
                           mylib::date(1943,2,4), mylib::date(1931,10,12),
                           mylib::date(1926,8,27)};
    size_t ndates = sizeof dates / sizeof dates[0];
    bubble_sort(dates, ndates);
    std::ostream_iterator<mylib::date> out_it(std::cout,"\n");
    std::copy(dates, dates + ndates, out_it);
}

int main(int argc,char* argv[])
{
	const int len=10;
	int ary[10]={0,4,6,2,3,1,5,7,9,8};
	print(ary,len);
	bubble_sort(ary,len);
	print(ary,len);

	return 0;
}

int main(int argc, const char *argv[])
{
    int i;
    int d[N]= {48,38,65,97,76,13,27,49};
    bubble_sort(d, N);
    for (i = 0; i < N; i++) {
        printf("%d \n",d[i]);
    }
    return 0;
}

int main(){
	int arr[]={-8,-3,-4,-6,-77,-88,-101};
	int arr_size=6;

	bubble_sort( arr, arr_size );
	print_array( arr, arr_size );

return 0;

}

void test_sort(int *numbers, int count, compare_cb cmp) {
  int i = 0;
  int *sorted = bubble_sort(numbers, count, cmp);
  if (!sorted) die("Sorting fail.");
  for (i = 0; i < count; i++) {
    printf("%d ", sorted[i]);
  }
  printf("\n");
  free(sorted);
}

int main()
{
    int N[10] = {1, 5, 4, 3, 2, 10, 7, 6, 8, 9};

    rand_array(N);
    print_array(N, 0);
    
    bubble_sort(N, 10);
    print_array(N, 0);
}

int main(int argc,char** argv)
{
    int array[9] = {9,7,5,4,6,8,1,3,2};
    bubble_sort(array,9);
    int i;
    for(i=0;i<9;i++){
        printf("current:%d \n",array[i]);
    }
    return 0;
}

int main(int argc, const char * argv[]) 
{    
    std::vector<int> array = create_random_array();
    std::cout << "  Before sorting: " << std::endl;
    printArray(array);
    bubble_sort(array);
    std::cout << "  After sorting: " << std::endl;
    printArray(array);
    return 0;
}