查找算法——二分查找

void fnBinarySearch(int t[], int left, int right)
{
    if (left <= right)
    {
        int mid = (left + right) >> 1;
        cout << t[mid] << ' ';
        fnBinarySearch(g_aList, left, mid - 1);
        fnBinarySearch(g_aList, mid + 1, right);
    }
}