二分查找算法

来源：互联网发布：淘宝如何删差评编辑：程序博客网时间：2024/06/05 04:44

二分查找算法是常用的查找算法

里面有很多注意的点

#include<iostream>using namespace std;#if 0//区间为[）型int BinarySearch(int*array, int size, int data){    int left = 0;    int right = size;    int m = 0;    while (left < right)    {        m = left + ((right - left) >> 1);        if (array[m] == data)            return m;        else if (array[m] < data)            left = m+1;        else             right= m;    }    return -1;}#endif#if 1//区间为[]型int BinarySearch(int*array, int size, int data){    int left = 0;    int right = size-1;    int m = 0;    while (left <= right)    {        m = left + ((right - left) >> 1);        if (array[m] == data)            return m;        else if (array[m] < data)            left = m + 1;        else            right = m-1;    }    return -1;}#endifint main(void){    int array[] = {1,4,5,7,8,9,11,14};    int i = BinarySearch(array, sizeof(array) / sizeof(array[0]), 8);    printf("%d\n",i+1);    return 0;}

阅读全文

0 0