考虑以下二分查找的代码:
#include <stdio.h> int bsearch(int array[], int n, int v) { int left, right, middle; left = 0, right = n - 1; while (left <= right) { middle = left + (right - left) / 2; if (array[middle] > v ) { right = middle; } else if (array[middle] < v) { left = middle; } else { return middle; } } return -1; }
对于输入array为:{2, 6, 8, 10, 13, 25, 36, 45, 53, 76, 88, 100, 127}, n
= 13, v = 127时,
运行bsearch函数,while循环调用的次数为____。