所以。我已经了解了二进制搜索及其工作原理,甚至在没有用户输入的情况下使用常量数组对其进行了尝试,但是现在我试图应用矢量而不是数组来让用户输入两个值列出要在其中搜索vector中的数字以及要搜索的目标的列表。在这里,我在使用数组时使用了普通的分而治之
using namespace std;
int Binary_search(int x[],int size,int target){
int maximum= size-1;
int minimum = 0;
int mean;
while (maximum>minimum){
mean = (maximum+minimum)/2;
if (x[mean] == target){
cout << "The number you're looking for is found! \n";
return mean;
}
else if(x[mean] > target){
maximum = (mean-1);
}
else{
minimum = (mean+1);
}
}
return -1;
}
int main(){
int x[]={1,2,3,4,5};
int a=sizeof(x)/sizeof(x[0]);
int target=4;
int show=Binary_search(x,a,target);
if (show != -1){
cout << "Your result is in the index: " << show;
}
return 0;
}
我的问题是,我使用vector进行了几乎相同的方法,但是它显示了无限数量的**您的结果在索引处发现:**(错误索引的数量)。或它根本不显示任何结果,甚至显示未找到结果,每次都会有所不同。这里是使用向量
#include <iostream>
#include <vector>
using namespace std;
int Binary_search(vector<int>x,int target){
int maximum=(x.size())-1;
int minimum = 0;
int mean;
while (maximum>minimum){
mean = (maximum+minimum)/2;
if (x[mean] == target){
cout << "The number you're looking for is found! \n";
}
else if(x[mean] > target){
maximum = (mean-1);
}
else{
minimum = (mean+1);
}
}
return -1;
}
int main(){
unsigned int i;
int n;
vector<int>x;
cout << "Enter the amount of numbers you want to evaluate: ";
cin >> i;
cout << "Enter your numbers to be evaluated: " << endl;
while (x.size() < i && cin >> n){
x.push_back(n);
}
int target;
cout << "Enter the target you want to search for in the selected array \n";
cin >> target;
int show = Binary_search(x,target);
if (show == -1){
cout << "Your result is not found ! ";
}
else{
cout << "Your result is in the index: " << show;
}
return 0;
}
所以我认为问题出在这部分int maximum=(x.size())-1;
,也许是关于如何使用向量的大小?有人可以启发我[]
所以。我已经了解了二进制搜索及其工作原理,甚至在没有用户输入的情况下使用常量数组对其进行了尝试,但是现在我试图应用矢量而不是数组来让用户...
您需要在此行之后输入return mean
cout << "The number you're looking for is found! \n";
问题:
嗯,其他答案有助于解决问题,但如果您不知道,可以在C++
中使用内置函数执行binary search