2023年11月8日
c++简单的二分查找
摘要： int s(int shuzu[], int len, int x) { int low = 0, hight = len - 1, mid; while (low<=hight) { mid = (low + hight) / 2; if (shuzu[mid] == x) return shuz 阅读全文
posted @ 2023-11-08 21:49 kill比尔 阅读(14) 评论(0) 推荐(0)