摘要：
void bubble(int *arr,int n){ for (int i = 1; i <= n - 1; i++) { int flag = 1; for (int j = 1; j <= n - i; j++) { if (arr[j] > arr[j + 1]) { int temp; 阅读全文
posted @ 2023-11-09 21:35
午夜凶铃
阅读(10)
评论(0)
推荐(0)
摘要：
int binarysearch(int *arr, int n, int a)//n-元素总个数，a-目标元素{ int left = 0; int right = n; while (right - left != 1) { int mid; mid = (left + right) / 2; 阅读全文
posted @ 2023-11-09 20:58
午夜凶铃
阅读(10)
评论(0)
推荐(0)
浙公网安备 33010602011771号