Binary search

1. //二分查找法
2. template<class T>
3. int BinarySearch( T a[], const T& x, int n)
4. {
5. int left = 0;
6. int right = n-1;
7. while (left <= right) {
8. int middle = (left + right) /2;
9. if ( x==a[middle])
10. return middle;
11. if ( x>a[middle]) left = middle + 1;
12. else right = middle -1;
13. }
14. // x not found
15. return -1;
16. }