运用二分查找法在一个整形有序数组中查找具体数字

#include <stdio.h>

#pragma warning(disable:4996)



int FindData(int arr[], int num, int who) {

int left = 0;

int right = num - 1;

while (right>=left) {

int mid = (left + right) / 2;

if (who < arr[mid]) {

right = mid - 1;

}

else if (who > arr[mid]) {

left = mid + 1;

}

else

return mid;

}

return -1;

}



int main() {

int who = 9;

int arr[] = { 1,2,3,4,5,6,7,8,9,11,22,33,44 };

int num = sizeof(arr) / sizeof(arr[0]);

int index = FindData(arr,num,who);

printf("index:%d\n", index);

}