查找算法——二分查找

如有错误，请务必指出，谢谢！

#include <stdio.h>

 int main(int argc, char** argv)
{
    int array[] = {1, 3, 5, 24, 35, 45, 67, 73, 76, 78, 98, 99, 200, 201, 202, 455, 3445};
    int length = sizeof(array)/sizeof(int);
    int low, mid, high, temp;
    char c = 'a';

    while (c != 'q')
    {
        printf("in:");
        scanf("%d", &temp);

        low = 0;
        high = length;
        mid = (high + 1 + low) / 2;

        while(low <= high)
        {
            if (temp < array[mid])
            {
                high = mid - 1;
                mid = (high + low + 1) / 2;
            }
            else if (temp > array[mid])
            {
                low = mid + 1;
                mid = (high + low + 1) / 2;
            }
            else
            {
                printf("\n\t %d is found. Index is %d.\n", temp, mid);
                break;
            }
        }    
    }    
}