C語言快速排序與二分查找算法示例

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
void quiksort(int a[],int low,int high)
{
 int i = low;
 int j = high;
 int temp = a[i];
 if( low < high)
 {
  while(i < j)
  {
   while((a[j] >= temp) && (i < j))
   {
    j--;
   }
   a[i] = a[j];
   while((a[i] <= temp) && (i < j))
   {
    i++;
   }
   a[j]= a[i];
  }
  a[i] = temp;
  quiksort(a,low,i-1);
  quiksort(a,j+1,high);
 }
 else
 {
  return;
 }
}
int search(int x, int v[], int n){
 int low, high, mid;
 low = 0;
 high = n - 1;
 while ( low <= high ) {
  mid = (low + high) / 2;
  if(x < v[mid]){
   high = mid - 1;
  }
  else if(x > v[mid]){
   low = mid + 1;
  }
  else{
   return mid;
  }
 }
 return -1;
}
int main(){
 int arry[100] ;
 int i,j;
 srand((unsigned)time(NULL)); //產生不同的隨機數(shù)
 for(i=0;i<100;i++)
 {
  j = rand()%100;
  //if(i%2==0) //產生負數(shù)
  //j =-j;
  arry[i]=j;
 }
 int location;
 int number ;
 quiksort(arry,0,99);//隨機數(shù)先進行排序
 for(i=0;i<100;i++)
 {
  printf("%d ",arry[i]);
 }
 printf("\n");
 printf("請輸入你要查找的數(shù)字");
 scanf("%d",&number);
 location = search(number, arry, 100);
 printf("%d\n", location);
 return 0;
}