实验六完成

homework6/test1.cpp

@@ -13,7 +13,7 @@ int seqSearch(vector<T> l,T value) {
     bool found = false;
     int index = 0;
     for (int i=0; i<l.size(); i++) {
-        cout<<"正在顺序查找第"<<i<<"位元素"<<"其值为"<<l.at(i)<<endl;
+        cout<<"正在顺序查找第"<<i+1<<"位元素"<<"其值为"<<l.at(i)<<endl;
 
         if (l.at(i) == value) {
             found = true;

homework6/test2.cpp

@@ -5,33 +5,33 @@
 using namespace std;
 
 template <typename T>
-
-void ListBinaryCopy(vector<T> p,vector<T> sl,vector<T> sr) {
-    int low=0;
-    int high=p.size()-1;
-    int mid=(low+high)/2;
-
-    for (int i=low;i<=mid;i++) {
-        sl[i]=p[i];
+int BinarySearch(const vector<T>& arr, T target, int left, int right) {
+    if (left > right) {
+        return -1; // 未找到目标值
     }
 
-    for (int i=mid+1;i<=high;i++) {
-        sr[i]=p[i];
+    int mid = left + (right - left) / 2; // 计算中间位置
+
+    cout << "正在查找第"<<mid+1 <<"位"<<"其值为"<<arr.at(mid)<< endl;
+
+    if (arr[mid] == target) {
+        return mid; // 找到目标值，返回索引
+    } else if (target < arr[mid]) {
+        return BinarySearch(arr, target, left, mid - 1); // 在左半部分递归查找
+    } else {
+        return BinarySearch(arr, target, mid + 1, right); // 在右半部分递归查找
     }
 }
 
 template <typename T>
-int BinarySearch(vector<T> l, T value) {
-    if (l.empty()) return -1;
-
-    vector<T> sub_list_left, sub_list_right;
-    ListBinaryCopy(l, sub_list_left);
-
-    BinarySearch(sub_list_left, value);
-    BinarySearch(sub_list_right, value);
+int BinarySearch(const vector<T>& arr, T target) {
+    return BinarySearch(arr, target, 0, arr.size() - 1);
 }
 
+
 int main() {
     vector<int> l = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
+    const int index=BinarySearch(l, 9);
+    cout<<index<<endl;
     return 0;
 }