我正在比较线性搜索和二进制搜索以及每个搜索的速度。但是当我编译程序时什么都没有显示,我不知道为什么。当我只输入它的线性搜索部分并对其进行测试时,这很有效。任何帮助将不胜感激~~。谢谢你。
#include <iostream>
using namespace std;
int linearSearch(const int integerArray[],int,int);
int binarySearch(const int integerArray[],int,int);
const int SIZE = 20;
int main()
{
int integerArray[SIZE]={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,10};
int position1,position2;
cout << "This program will compare search efficiency for the linear and binary searches " << endl;
position1 = linearSearch(integerArray,SIZE,7);
position2 = binarySearch(integerArray,SIZE,7);
cout << position1 << endl;
cout << position2 << endl;
return 0;
}
int linearSearch(const int integerArray[],int SIZE,int value)
{
int index = 0;
int position1 = -1;
bool foundNum = false;
while(index < SIZE)
{
if(integerArray[index] == value)
{
foundNum = true;
position1 = index;
}
index++;
}
return position1;
}
int binarySearch(const int integerArray[],int size,int value)
{
int first = 0;
int last = size-1;
int midpoint = (first+last)/2;
int position2 = -1;
bool foundNum = false;
while(!foundNum && first<=last)
{
if(integerArray[midpoint] == value)
{
foundNum = true;
position2++;
return position2;
}
else if(integerArray[midpoint] > value)
{
last = midpoint-1;
position2++;
}
else
last = midpoint+1;
position2++;
}
return position2;
}