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;} 

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

int main(void) { 
    int number[MAX] = {0}; 
    int i, find; 
    srand(time(NULL)); 

    for(i = 0; i < MAX; i++) { 
        number[i] = rand() % 100; 
    } 

    quicksort(number, 0, MAX-1); 

    printf("数列："); 
    for(i = 0; i < MAX; i++) 
        printf("%d ", number[i]); 

    printf("\n输入寻找对象："); 
    scanf("%d", &find); 

    if((i = bisearch(number, find)) >= 0) 
        printf("找到数字于索引 %d ", i); 
    else