#include<stdio.h>#include<stdlib.h>#include<string.h>#define SIZE 100//從小到大排序int comp1(const void *x,const void *y){    return *(int *)x - *(int *)y;}//從大到小排序int comp2(const void *x,const void *y){    return *(int *)y - *(int *)x;}void main(){     int arr[SIZE];     int n = 0; //數(shù)組的有效長度     int t = 0;     int i;     printf("input the arr(Q to quit)./n");     while( (t = scanf("%d",&arr[n])) != 0)    {        n++;    }    printf("arr before qsort./n");    for(i = 0; i < n; i++)    {         printf("arr[%d]=%d/t",i,arr[i]);        if((i+1) % 5 == 0)        {            printf("/n");        }    }   qsort(arr,n,sizeof(int),comp1);   printf("/narr after qsort./n");   for(i = 0; i < n; i++)   {       printf("arr[%d]=%d/t",i,arr[i]);       if((i+1) % 5 == 0)       {            printf("/n");       }    }    qsort(arr,n,sizeof(int),comp2);    printf("/nRecover All./n");   for(i = 0; i < n; i++)   {        printf("arr[%d]=%d/t",i,arr[i]);       if((i+1) % 5 == 0)       {           printf("/n");       }    }printf("/n");}

#include<stdio.h>#include<time.h>#include<stdlib.h>#define LEN 10typedef int dataType;//初始化數(shù)組,數(shù)組元素為小于100的整數(shù)void intiArr(dataType A[], int len);//打印數(shù)組元素void print(dataType A[], int len);//帶兩個參數(shù)的快排void qsort(dataType A[], int len);int main(){ dataType data[LEN]; intiArr(data,LEN); printf("排序前數(shù)組元素："); print(data,LEN); qsort(data,LEN); printf("排序后數(shù)組元素："); print(data,LEN); return 0;}

void intiArr(dataType A[], int len){ int i; srand((unsigned)time(NULL)); for(i = 0; i < len; i++) { A[i] = rand() % 100; }}

void print(dataType A[], int len){ int i; for(i = 0; i < len; i++) { if(i % 5 == 0)  printf("/n"); printf("%d/t",A[i]); } printf("/n");}

void qsort(dataType A[], int len){ dataType *p = A; dataType *q = A + len - 1; dataType temp = *p;; if(len <= 0) { return ; } while(p < q) { while((p < q) && (*q >= temp)) {  q--; } *p = *q; while((p < q) && (*p <= temp)) {  p++; } *q = *p; } *p = temp; qsort(A,p - A); qsort(p + 1,len - (p - A) - 1);}