2013年3月4日
Binary search and so forth
摘要： Binary search is simple in concept but quite error-prone in implementation. Better keep one for later use. My version may look like,static int BinarySearch(TListRef list, int start, int count, const T &item, const IComparer<T> &comparer) { int low = start; int high = start + count; int 阅读全文
posted @ 2013-03-04 07:16 quanben 阅读(185) 评论(0) 推荐(0)