passnoj的博客

原创 noj算法1001二分查找

#include <stdio.h> int n; int binarySearch(int a[],long key) { int left = 0; int right = n; while(left<=right) { int mid = (left+right)/2; if(a[mid]==key) { return mid; } e...