冒泡排序和折半查找

/**////
//从键盘输入10个整数到数组B中，然后对其排序，并显示中间结果
/**////
#include<iostream>
#include<iomanip> //setw() using it
using namespace std;
void main()
...{
    const int n=10;
    int b[n],i,j;
    cout<<"input 10 integers:"<<endl;
    for(i=0;i<10;i++)
    ...{
        cin>>b[i];
    }
    for(i=0;i<n-1;i++)//need ten times sorting
    ...{
        int largeEleIdx=i;
        for(j=i+1;j<n;j++)//begin compare from next integer 
        ...{
            if(b[j]>b[largeEleIdx])
                largeEleIdx=j;//change the index 
        }
        int temp;
        temp=b[i];
        b[i]=b[largeEleIdx];
        b[largeEleIdx]=temp;//change the place
        cout<<"i= "<<i<<" :";
        for(j=0;j<n;j++)
        ...{
            cout<<setw(6)<<b[j];
        }
        cout<<endl;
    }
    cout<<"result :";
    for(i=0;i<n;i++)
        cout<<setw(6)<<b[i];
    cout<<endl;

    /**////
    //折半查找
    /**////
    int low=0,high=n-1,mid,key,midVal,found=0;
    cout<<"search-element=";
    cin>>key;
    while(low<=high)
    ...{
        mid=(low+high)/2;
        midVal=b[mid];
        if(key==midVal)
        ...{
            found=1;
            break;
        }
        else
        ...{
            if(key>midVal)
                high=mid-1;
            else
                low=mid+1;
        }

    }
    if(found)
        cout<<"index= "<<mid<<endl;
    else
        cout<<"no such element!"<<endl;


}