From 1fba558d434ba625a9fb743f77b5a300e874da11 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:10:19 +0800
Subject: [PATCH] =?UTF-8?q?=E6=94=B9=E6=88=90vector=E4=BA=86?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 homework6/test1.cpp | 14 +++++++-------
 homework6/test2.cpp | 32 ++++++++++++++++++++++++++++++--
 2 files changed, 37 insertions(+), 9 deletions(-)

diff --git a/homework6/test1.cpp b/homework6/test1.cpp
index 1ffb137..fcc7807 100644
--- a/homework6/test1.cpp
+++ b/homework6/test1.cpp
@@ -1,25 +1,25 @@
 // 编写一个程序，输出在顺序表(3,6,2,10,l,8,5,7,4,9) 中采用顺序查找方法查找关键字5的过程。
-#include <list>
+#include <vector>
 #include <iostream>
 
 using namespace std;
 
 template <typename T>
-int seqSearch(list<T> l,T value) {
+int seqSearch(vector<T> l,T value) {
     if (l.empty()) {
         cout << "空表" << endl;
         return -1;
     }
     bool found = false;
     int index = 0;
-    for (typename list<T>::iterator it = l.begin(); it != l.end(); ++it) {
-        cout<<"正在顺序查找第"<<index<<"位元素"<<"其值为"<<*it<<endl;
+    for (int i=0; i<l.size(); i++) {
+        cout<<"正在顺序查找第"<<i<<"位元素"<<"其值为"<<l.at(i)<<endl;
 
-        if (*it == value) {
+        if (l.at(i) == value) {
             found = true;
+            index = i;
             break;
         }
-        index++;
     }
 
     if (!found) {
@@ -32,7 +32,7 @@ int seqSearch(list<T> l,T value) {
 }
 
 int main() {
-    list<int> l={3,6,2,10,'l',8,5,7,4,9};
+    vector<int> l={3,6,2,10,'l',8,5,7,4,9};
     int index=seqSearch(l,5);
     cout<<index<<endl;
     return 0;
diff --git a/homework6/test2.cpp b/homework6/test2.cpp
index 3635471..0b28cfe 100644
--- a/homework6/test2.cpp
+++ b/homework6/test2.cpp
@@ -1,9 +1,37 @@
 // 编写一个程序，输出在顺序表(1,2, 3, 4, 5, 6, 7, 8, 9, 10)中采用折半查找方法查找关键字9的过程。
 #include<iostream>
-#include<list>
+#include<vector>
 
 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];
+    }
+
+    for (int i=mid+1;i<=high;i++) {
+        sr[i]=p[i];
+    }
+}
+
+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 main() {
+    vector<int> l = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
     return 0;
-}
\ No newline at end of file
+}