[英]Recursive Binary Search Program C
如果密鑰小於等於 11,則以下代碼運行良好,但如果密鑰大於 11,則它不會返回任何內容。
#include<stdio.h>
#include<time.h>
int BinaryS(int a[],int l, int h,int key)
{
if(h >= l){
int mid = (h-l)/2;
if(a[mid] == key)
return mid;
if(a[mid] > key)
return BinaryS(a,l,mid-1,key);
return BinaryS(a,mid+1,h,key);
}
return -1;
}
int main(void)
{
int a[]={10,11,15,19,22,23,30,40,45,50};
int n;
printf("Enter the number to be searched\n");
scanf("%d",&n);
int num=10;
int clock_t,start_t,end_t,total;
start_t = clock();
int f = BinaryS(a,0,num-1,n);
end_t = clock();
total = (end_t-start_t)/CLOCKS_PER_SEC;
printf("Time taken: %d\n",total);
if(f == -1){
printf("Key not found in the array ");
}
else{
printf("Key found at: %d",f+1);
}
return 0;
}
int mid = (hl)/2;
肯定是錯的。 mid
應該是(h + l)/2
。
聲明:本站的技術帖子網頁,遵循CC BY-SA 4.0協議,如果您需要轉載,請注明本站網址或者原文地址。任何問題請咨詢:yoyou2525@163.com.