二分查找算法

1. 二份查找思路

比较key 跟中间元素，如果相等返回位置，如果大于则在后半部分查找，如果小于则在前半部分查找。实现方式有递归和while循环。

2. 实现

2.1 C语言实现

#include <stdio.h>

int binary_search(int a[], int start, int end, int key)
{
    int mid = start + (end - start)/2;
    if (start > end)
    {
        return -1;
    }
    if(a[mid] == key)
    {
        return mid;
    }
    else if(key > a[mid])
    {
        return binary_search(a, mid + 1, end, key);
    }
    else if(key < a[mid])
    {
        return binary_search(a, start, mid-1, key);
    }
}
void main()
{
    int a[10]= {1,2,3,4,5,6,7,8,9,10};
    int position;
    position = binary_search_2(a, 0, 9, 4);
    printf("position is : %d\n", position);
}

#include <stdio.h>

int binary_search_2(int a[], int start, int end, int key)
{
    int mid;
    while(start <=  end){
        mid = start + (end - start)/2;
        if(a[mid] == key)
        {
            return mid;
        }
        else if(key > a[mid])
        {
            start = mid + 1;
        }
        else if(key < a[mid])
        {
            end = mid - 1;
        }

    }
    return -1;
}
void main()
{
    int a[10]= {1,2,3,4,5,6,7,8,9,10};
    int position;
    position = binary_search_2(a, 0, 9, 4);
    printf("position is : %d\n", position);
}

2.2 python 实现

def binary_search_1(array, start, end, key):
    while start <= end:
        mid = start + (end - start)/2
        if key > array[mid]:
            start = mid + 1
        elif key < array[mid]:
            end = mid-1
        else:
            return mid

    return -1

def binary_search_2(array, start, end, key):
    mid = start + (end - start)/2
    if start > end:
        return -1
    if key < array[mid]:
       return binary_search_2(array, start, mid-1, key)
    elif key > array[mid]:
        return binary_search_2(array, mid+1, end, key)
    else:
        return mid


if __name__ == "__main__":
    a = [i for i in range(10)]
    print a
    print binary_search_2(a, 0, 9, 8)

3. 总结

3.1 递归要有结束条件，否则将一直递归下去导致栈溢出；

3.2 中间位置的计算为: mid = start + (end - start)/2