摘要: 二分查找法[cpp] view plaincopyint binSearch(int key,int length, int array[]) { int mid=0; int start = 0; int end = length - 1; ... 阅读全文
posted @ 2014-12-25 01:01 MMLoveMeMM 阅读(339) 评论(0) 推荐(0)