From f746c7cf86a227b09c9f42d26a91ee7f305e1b5b Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E5=BE=A1=E5=9D=82=E6=98=B4?= <gugugulaocuchen@gmail.com>
Date: Sun, 22 Dec 2024 01:27:31 +0800
Subject: [PATCH] =?UTF-8?q?=E4=BF=AE=E9=A5=B0=E4=B8=80=E4=B8=8B?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 homework6/test2.cpp | 18 +++++++++---------
 1 file changed, 9 insertions(+), 9 deletions(-)

diff --git a/homework6/test2.cpp b/homework6/test2.cpp
index 4c97786..625f687 100644
--- a/homework6/test2.cpp
+++ b/homework6/test2.cpp
@@ -5,33 +5,33 @@
 using namespace std;
 
 template <typename T>
-int BinarySearch(const vector<T>& arr, T target, int left, int right) {
+int BinarySearch(vector<T> l, T value, int left, int right) {
     if (left > right) {
         return -1; // 未找到目标值
     }
 
     int mid = left + (right - left) / 2; // 计算中间位置
 
-    cout << "正在查找第"<<mid+1 <<"位"<<"其值为"<<arr.at(mid)<< endl;
+    cout << "正在查找第"<<mid+1 <<"位"<<"其值为"<<l.at(mid)<< endl;
 
-    if (arr[mid] == target) {
+    if (l[mid] == value) {
         return mid; // 找到目标值，返回索引
-    } else if (target < arr[mid]) {
-        return BinarySearch(arr, target, left, mid - 1); // 在左半部分递归查找
+    } else if (value < l.at(mid)) {
+        return BinarySearch(l, value, left, mid - 1); // 在左半部分递归查找
     } else {
-        return BinarySearch(arr, target, mid + 1, right); // 在右半部分递归查找
+        return BinarySearch(l, value, mid + 1, right); // 在右半部分递归查找
     }
 }
 
 template <typename T>
-int BinarySearch(const vector<T>& arr, T target) {
-    return BinarySearch(arr, target, 0, arr.size() - 1);
+int BinarySearch(vector<T> l, T value) {
+    return BinarySearch(l,value, 0, l.size() - 1);
 }
 
 
 int main() {
     vector<int> l = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
-    const int index=BinarySearch(l, 9);
+    int index=BinarySearch(l, 9);
     cout<<index<<endl;
     return 0;
 }