摘要: 1、二分查找(折半查找) #include<stdio.h> int main() { int arr[] = { 1,2,3,4,5,6,7,8,9,10 }; int left = 0; int sz = sizeof(arr) / sizeof(arr[0]); int right = sz 阅读全文
posted @ 2023-08-15 17:29 MaydayComes 阅读(7) 评论(0) 推荐(0)