快速排序(Quick sort)用法简析

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53

/**
 * Program name: quick_sort.c
 * Description: 快速排序法
 * Created date: 2012/08/28
 */
#include <stdio.h>
#define n 5
void quickSort(); 

int main(void){
    int arr[n]={101,4,70,83,12};    
    int i;    
    
    quickSort(arr,0,n-1);
    
    printf("[快速排序結果]: ");  
    for(i=0;i<n;i++)
        printf("%d,",arr[i]); 
        
    printf("\n");     
    system("pause");    
}

void quickSort(int *arr, int p, int q){
    int i,j,k,t;
        
    if(p < q){
        i = p;
        j = q + 1;
        k = arr[p];
        do{
            do{
                i++;
            }while(arr[i] < k);  
            do{
                j--;              
            }while(arr[j] > k);                   
            
            if(i <= j){                
                t = arr[i];
                arr[i] = arr[j];
                arr[j] = t;  
            }                
        }while(i <= j);
                
        t = arr[p];
        arr[p] = arr[j];
        arr[j] = t; 
        
        quickSort(arr,p,j-1);
        quickSort(arr,j+1,q);                       
    }    
}