二分查找

题目：输入指定列表和一个待查找的元素，输出元素是否在列表中，若存在则返回下标

思想：利用二分查找来做，事先需要对列表进行排序，二分查找只对有序表有效

#!usr/bin/env python  
#encoding:utf-8  
  
'''
__Author__:沂水寒城 
功能：二分查找
''' 
 
 
def binary_search(num_list, x):
    '''
    二分查找
    '''
    num_list=sorted(num_list)
    left, right = 0, len(num_list)
    while left < right:
        mid = (left + right) / 2
        if num_list[mid] > x:
            right = mid
        elif num_list[mid] < x:
            left = mid + 1
        else:
            return '待查元素{0}在列表中下标为：{1}'.format(x, mid)
    return  '待查找元素%s不存在指定列表中'%x
 
 
 
if __name__ == '__main__':
    num_list = [34,6,78,9,23,56,177,33,2,6,30,99,83,21,17]
    print binary_search(num_list, 34)
    print binary_search(num_list, 177)
    print binary_search(num_list, 21)
    print binary_search(num_list, 211)
    print binary_search(num_list, 985)

左旋数组中二分查找

#include <stdio.h>
#include <stdlib.h>
 
int binary_search_in(int a[], int n, int x)
{
	int left = 0;
	int right = n-1;
	while(left <= right)
	{
		int mid = left + ((right - left)>>1);
		if(a[mid] == x)
			return mid;
		if(a[mid] >= a[left])   //左边有序
		{
			if(x < a[mid] && x >= a[left])
			{
				right = mid - 1;
			}
			else
			{
				left = mid + 1;
			}
		}
		else    //右边有序
		{
			if(x > a[mid] && x <= a[right])
			{
				left = mid + 1;
			}
			else
			{
			 right = mid - 1;
			}
		}
	}
	return -1;
}
 
int main()
{
	int a[] = {9,10,15,1,3,7};
	printf("%d",binary_search_in(a, 6, 10) );
	system("pause");
}