快排总结 原代码 以及 如何调用

No.1对int型数组排序

/*#include<stdio.h>
void qsort(int a[], int left, int right)
{
    int i, j, x;
    x = a[left]; i = left; j = right;
    if(i >= j) return;
    while(i < j)
    {
        while(i < j && a[j] >= x) j--;
        a[i] = a[j];
        while(i < j && a[i] <= x) i++;
        a[j] = a[i];
    }
    a[i] = x;
    qsort(a, left, i - 1);
    qsort(a, i + 1, right);
}
int main()
{
    int a[5] = {5, 4, 3, 2, 1};
    int i;
    qsort(a, 0, 4);
    for(i = 0; i < 5; i++)
    printf("%d", a[i]);
    return 0;
}*/
#include<stdio.h>
#include<stdlib.h>
int cmp(const void *a, const void *b)
{
    return *(int *)a - *(int *)b;/*/*这里的（int*）a定义了一个指向int型的指针，注意int *两边的括号不能少，然后（int *）a前面加上*就表示取其指向的值。这里是升序， 反之*(int *)b - *(int *)a是降序。*/
}
int main()
{
    int a[5] = {5, 4, 3, 2, 1};
    int i;
    qsort(a, 5, sizeof(a[0]), cmp);
    for(i = 0; i < 5; i++)
    printf("%d", a[i]);
    return 0;
}

No.2对double型数组排序

#include<stdio.h>
void qsort(double a[], int left, int right)
{
    int i, j;
    double x;
    x = a[left]; i = left; j = right;
    if(i >= j) return;
    while(i < j)
    {
        while(i < j && a[j] >= x) j--;
        a[i] = a[j];
        while(i < j && a[i] <= x) i++;
        a[j] = a[i];
    }
    a[i] = x;
    qsort(a, left, i - 1);
    qsort(a, i + 1, right);
}
int main()
{
    double a[5] = {5, 4, 3, 2, 1};
    int i;
    qsort(a, 0, 4);
    for(i = 0; i < 5; i++)
    printf("%.lf", a[i]);
    return 0;
}
/*#include<stdio.h>
#include<stdlib.h>
int cmp(const void *a, const void *b)
{
    return (*(double *)a - *(double *)b > 0)? 1 : -1;/*注意这里不能像上面对int型数组排序时那样直接返回*(double*)a-*(double*)b，因为这个cmp函数的返回值已经规定了是int型，而*(double*)a-*(double*)b是double型。*/
}
int main()
{
    double a[5] = {5, 4, 3, 2, 1};
    int i;
    qsort(a, 5, sizeof(a[0]), cmp);
    for(i = 0; i < 5; i++)
    printf("%.lf", a[i]);
    return 0;
}*/

No.3对一个字符数组排序

/*#include<stdio.h>
void qsort(char a[], int left, int right)
{
    int i, j;
    char x;
    x = a[left]; i = left; j = right;
    if(i >= j) return;
    while(i < j)
    {
        while(i < j && a[j] >= x) j--;
        a[i] = a[j];
        while(i < j && a[i] <= x) i++;
        a[j] = a[i];
    }
    a[i] = x;
    qsort(a, left, i - 1);
    qsort(a, i + 1, right);
}
int main()
{
    char a[5] = {'e', 'd', 'c', 'b', 'a'};
    int i;
    qsort(a, 0, 4);
    for(i = 0; i < 5; i++)
    printf("%c", a[i]);
    return 0;
}*/
#include<stdio.h>
#include<stdlib.h>
int cmp(const void *a, const void *b)
{
    return *(char *)a - *(char *)b;//这里直接把字符的ASCII码相减来比较字符的先后顺序
}
int main()
{
    char a[5] = {'e', 'd', 'c', 'b', 'a'};
    int i;
    qsort(a, 5, sizeof(a[0]), cmp);
    for(i = 0; i < 5; i++)
    printf("%c", a[i]);
    return 0;
}

No.4对字符串数组的排序(char s[][]型)

/*#include<stdio.h>
#include<string.h>
void qsort(char a[][10], int left, int right)
{
    int i, j;
    char x[10];
    strcpy(x, a[left]); i = left; j = right;
    if(i >= j) return;
    while(i < j)
    {
        while(i < j && strcmp(x, a[j]) <= 0) j--;
        strcpy(a[i], a[j]);
        while(i < j && strcmp(x, a[i]) >= 0) i++;
        strcpy(a[j], a[i]);
    }
    strcpy(a[i], x);
    qsort(a, left, i - 1);
    qsort(a, i + 1, right);
}
int main()
{
    char a[5][10] = {"apple", "orange", "banana", "sydney", "peach"};
    int i;
    qsort(a, 0, 4);
    for(i = 0; i < 5; i++)
    printf("%s\n", a[i]);
    return 0;
}*/
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int cmp(const void *a, const void *b)
{
    return strcmp((char*)a, (char*)b);/*这里调用了strcmp比较函数，这个函数根据字典序对字符串进行比较，按字符串的先后顺序依次返回1或0或-1*/
}
int main()
{
    char a[5][10] = {"apple", "orange", "banana", "sydney", "peach"};
    int i;
    qsort(a, 5, sizeof(a[0]), cmp);
    for(i = 0; i < 5; i++)
    printf("%s\n", a[i]);
    return 0;
}

No.5对指针数组排序(char *s[]型)

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int cmp(const void *a,const void*b)
{
    return strcmp(*(char**)a,*(char**)b);//注意这里使用char**表示指针的指针
}
char *s[100];//定义了一个指针数组，亦可称为指针的指针
int i,n;
int main()
{
    scanf("%d",&n);
    for(i=0; i<n; i++)
    {
        s[i]=(char*)malloc(sizeof(char*));
        scanf("%s",s[i]);
    }
    qsort(s, n, sizeof(s[0]),cmp);
    for(i=0; i<n; i++)
        printf("%s\n",s[i]);
}

No.6对结构体排序

/*#include<stdio.h>
#include<stdlib.h>
typedef struct node
{
    int data;
}ST;
void sort(ST a[], int left, int right)
{
    ST t;
    int i, j, x;
    t = a[left];
    x = a[left].data;
    i = left; j = right;
    if(i >= j) return;
    while(i < j)
    {
        while(i < j && a[j].data >= x) j--;
        a[i] = a[j];
        while(i < j && a[i].data <= x) i++;
        a[j] = a[i];
    }
    a[i] = t;
    sort(a, left, i - 1);
    sort(a, i + 1, right);
}
int main()
{
    ST a[500];
    int i, n;
    while(~scanf("%d", &n))
    {
        for(i = 0; i < n; i++)
        scanf("%d", &a[i].data);
        sort(a, 0, n - 1);
        for(i = 0; i < n; i++)
        printf("%d", a[i].data);
        printf("\n");
    }
    return 0;
}*/
#include<stdio.h>
#include<stdlib.h>
typedef struct node
{
    int data;
}ST;
int cmp(const void *a, const void *b)
{
    ST *aa = (ST *)a;
    ST *bb = (ST *)b;
    return aa->data - bb->data;/*注意，这里的struct node*跟前面的int*,double*原理一样，都是一种指针类型，这里是自己定义的一个指向结构体的指针类型，故写法为struct 结构体名称*，这里date是double型数据，故不可能有相等情况出现，只需返回1和-1即可*/
}
int main()
{
    ST a[500];
    int i, n;
    while(~scanf("%d", &n))
    {
        for(i = 0; i < n; i++)
        scanf("%d", &a[i].data);
        qsort(a, n, sizeof(a[0]), cmp);
        for(i = 0; i < n; i++)
        printf("%d", a[i].data);
        printf("\n");
    }
    return 0;
}

No.7对结构体排序(当data相等按flag排序)

/*#include<stdio.h>
#include<stdlib.h>
typedef struct node
{
    double data;
    int flag;
}ST;
void sort(ST a[], int left, int right)
{
    ST t;
    int i, j, x, x1;
    t = a[left];
    x = a[left].data;
    x1 = a[left].flag;
    i = left; j = right;
    if(i >= j) return;
    while(i < j)
    {
        while( i < j && (a[j].data > x || (a[j].data == x && a[j].flag >= x1)) ) j--;
        a[i] = a[j];
        while( i < j && (a[i].data < x || (a[i].data == x && a[i].flag <= x1)) ) i++;
        a[j] = a[i];
    }
    a[i] = t;
    sort(a, left, i - 1);
    sort(a, i + 1, right);
}
int main()
{
    ST a[500];
    int i, n;
    while(~scanf("%d", &n))
    {
        for(i = 0; i < n; i++)
        {
            scanf("%lf %d", &a[i].data, &a[i].flag);
        }
        sort(a, 0, n - 1);
        for(i = 0; i < n; i++)
        {
            printf("%.lf %d\n", a[i].data, a[i].flag);
        }
        printf("\n");
    }
    return 0;
}*/
#include<stdio.h>
#include<stdlib.h>
typedef struct node
{
    double data;
    int flag;
}ST;
int cmp(const void *a, const void *b)
{
    ST *aa = (ST *)a;
    ST *bb = (ST *)b;
    if(aa->data != bb->data)
    return (aa->data > bb->data ? 1 : -1);
    else
    return aa->flag - bb->flag;
}
int main()
{
    ST a[500];
    int i, n;
    while(~scanf("%d", &n))
    {
        for(i = 0; i < n; i++)
        {
            scanf("%lf %d", &a[i].data, &a[i].flag);
        }
        qsort(a, n, sizeof(a[0]), cmp);
        for(i = 0; i < n; i++)
        {
            printf("%.lf %d\n", a[i].data, a[i].flag);
        }
        printf("\n");
    }
    return 0;
}