各种排序

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>

#define swap2(a, b){a = a + b; b = a - b; a = a - b; }//实测这种不好使，没研究为啥。。。

#define swap(a, b){\
    int c;\
    c = a;\
    a = b;\
    b = c;\
}
//获取num个随机数
long * get_rand_num(int num, int seed)
{
    long * re = NULL;
    int i = 0;

    re = malloc(sizeof(long) * num);
    memset(re, 0x00, sizeof(long) * num);

    srand(time(NULL));
    for(i = 0; i < num; i++)
        re[i] = rand() % seed;

    return re;
}

void print_nums(long * num, int idx)
{
    int i = 0;
    for(i = 0; i < idx; i++)
        printf("[%ld]", num[i]);
    printf("\n");
}

void myqsort(long * a , int num)
{
    int i = 1, j = num - 1, key = a[0];

    if(num <= 1)
        return;

    while(1){
        while(j > i && a[j] >= key) j--;
        while(j > i && a[i] <= key) i++;
        if(j != i){
            swap(a[i], a[j]);
        }else{
            if(a[i] > key)
                i--;//i==j时，需跟i前边的数换，保证key处于中间位置
            swap(a[i], a[0]);
            break;
        }
    }
    myqsort(a, i);
    myqsort(a + i + 1, num - i -1);
}

/*选择排序*/
void csort(long * nums, int num)
{
    int i = 0, j = 0;
    int tmp = 0;

    for(i = 0; i < num - 1; i++){
        tmp = i;
        for(j = i + 1; j < num; j++){
            if(nums[tmp] > nums[j])
                tmp = j;
        }
        if(tmp != i){
            swap(nums[i], nums[tmp]);
        }
    }
}

/*冒泡*/
void maopao(long * nums, int num)
{
    int i = 0, j = 0;

    for(i = 0; i < num; i++){
        for(j = 0; j < num -1 - i; j++){
            if(nums[j] > nums[j + 1]){
                swap(nums[j], nums[j + 1]);
            }
        }
    }
}

int main(int argc, char ** argv)
{
    long * nums = NULL;

    if(argc < 3){
        fprintf(stderr, "usage : like - %s  10000  10000 \n", argv[0]);
        return -1;
    }

    nums = get_rand_num(atoi(argv[1]), atoi(argv[2]));
    print_nums(nums, atoi(argv[1]));

    myqsort(nums, atoi(argv[1]));
    print_nums(nums, atoi(argv[1]));

    free(nums);

    return 0;
}