1. 二分查找的原理和实现?答案:前提条件数组必须有序支持随机访问原理每次比较中间元素根据比较结果缩小一半搜索范围时间复杂度:O(log n)迭代实现 int binarySearch(vector<int>& arr, int target) { int left = 0, right = arr.size() - 1; while (left <= right) { int mid = left + (right - left) / 2; if (arr[mid] == target) return mid; else if (arr[mid] < targ...