二分查找
摘要:
二分查找算法:二分查找求下界:class BinarySearch {public: int getPos(vector A, int n, int val) { // write code here int start=0, end=n; ... 阅读全文
posted @ 2015-09-20 20:44 gaoyanqing 阅读(146) 评论(0) 推荐(0) 编辑
posted @ 2015-09-20 20:44 gaoyanqing 阅读(146) 评论(0) 推荐(0) 编辑
posted @ 2015-09-20 13:00 gaoyanqing 阅读(2795) 评论(0) 推荐(0) 编辑