快速排序以及二分查找的实现

#include 

int BinSearch(int a[],int left,int right,int key);//声明二分查找
void QuickSort(int a[],int left,int right);//声明快速排序

int main()
{
    int a[101];
    int i,n,key;
    printf("Please input total number:");
    scanf("%d",&n);
    printf("Now please input %d numbers:",n);
    for(i=0;iright)
        return;
    while(i=key&&ikey)
        {
            return (BinSearch(a,low,mid-1,key));
        }
        else
        {
            return (BinSearch(a,mid+1,high,key));
        }
    }
    return -1;
}