C/C++冒泡排序，然后二分法搜索寻值

#include <iostream>

using namespace std;


void Bubble(int array[],int n)
{
    for(int i=0;i<n;i++)
        for (int j=0;j<n-1-i;j++)
        {
            int temp;
            if (array[j+1]<array[j])
            {
                temp = array[j+1];
                array[j+1] = array[j];
                array[j] =temp;
            }
        }
}

int BianrySearch(int Bianryarry[],int right,int left,int key)
{
    int mid;

    while(right <= left)
    {
        mid =right/2 + left/2;
        if (Bianryarry[mid] == key)
        {
            return mid;
        }
        else if (Bianryarry[mid] < key)
        {
            right = mid -1;//防止进入死循环

        }
        else if (Bianryarry[mid] > key)
        {
            left = mid +1;
        }

    }

    return -1;

}


int main()
{
    int Num[]={2,3,4,5,6,7,22,66,44,322,123,45,56,76};

    Bubble(Num,14);

    for (int i=0;i<14;i++)
        {
            cout<<Num[i]<<" ";
        }

    cout<<"\n寻找的key所在的位置："<<BianrySearch(Num,0,14,22);

    return 0;
}

查询结果：

特别好的讲解：
http://www.cnblogs.com/wuyuegb2312/archive/2013/05/26/3090369.html