填空以实现有序表的二分查找法（折半查找法）#include int Data[20]={12,16,19,22,25,32,39,48,55,57,58,63,68,69,70,78,84,88,91,97};int Binary_Search(int source[],int left,int right,int key){int middle;while(left<=right){middle=(1)/2;if(keysource[middle]){3=middle+1;}else if(key==source[middle]){printf("source[%d]=%d\n",middle,source[middle]);return 1;}}return 0;}