C经典算法之快速排序法（三）

#include <stdio.h> 
#include <stdlib.h> 
#include <time.h> 
#define MAX 10 
#define SWAP(x,y) {int t; t = x; x = y; y = t;} 

int partition(int[], int, int); 
void quicksort(int[], int, int); 

int main(void) { 
    int number[MAX] = {0}; 
    int i, num;  

    srand(time(NULL)); 

    printf("ÅÅĞòÇ°£º"); 
    for(i = 0; i < MAX; i++) { 
        number[i] = rand() % 100; 
        printf("%d ", number[i]); 
    } 

    quicksort(number, 0, MAX-1); 

    printf("\nÅÅĞòºó£º"); 
    for(i = 0; i < MAX; i++) 
        printf("%d ", number[i]); 
    
    printf("\n"); 

    return 0;