|
#include<stdio.h>
int BinarySearch(int A[], int first, int last, int K){
int mid;
if(first>last)
return -1;
mid = (first+last)/2;
if(K == A[mid])
return mid;
else if(K<A[mid])
return BinarySearch(A, first, mid-1, K);
else
return BinarySearch(A, mid+1, la
|
|
메뉴펼치기
