不知道有什么问题，求个位高手解答

[硅步小流]

#include <iostream>
#include <string>
using namespace std;

template<typename T>
int indexOfKey(T list[], int low, int high, T key);

template<typename T>
int indexOfKey(T list[], T key, int size);

int main()
{
int list1[10] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
int index1 = indexOfKey(list1, 2, 10);
cout << "The index of the key is " << index1 << endl;

double list2[10] = {1.2, 2.5, 3.1, 4, 5, 6, 7, 8.1, 9.5};
int index2 = indexOfKey(list2, 8.1, 10);
cout << "The index of the key is " << index2 << endl;

string list3[4] = {"BeiJing", "ShangHai", "HuNan", "ChenZhou"};
int index3 = indexOfKey(list3, "BeiJing", 4);
cout << "The index of the key is " << index3 << endl;

return 0;
}


template<typename T>
int indexOfKey(T list[], int low, int high, T key)
{
int low = 0;
int high = size - 1;

if (low > high)
return -1 - low;
else
{
int mid = (low + high) / 2;
if (key > list[mid])
return indexOfKey(list, mid + 1, high, key);
else
return indexOfKey(list, low, mid + 1, key);
}
}

template<typename T>
int indexOfKey(T list[], T key, int size)
{
int low = 0;
int high = size - 1;
return indexOfKey(list, low, mid + 1, key);
}

[高性能架构探索]

老大，你怎么也得贴出错误来吧

[bdmh]

神仙越来越多

[bdmh]

就是有问题，就是你的查找算法有问题

[硅步小流]

我就是不知道什么问题，所以请各位高手讲详细些

[硅步小流]

我用的是二分法搜索

[硅步小流]

请各位高手随便把QQ留一下

[一根烂笔头]

不是高手，只是游击战士

[碎碎念]

这个函数定义是...没加参数size...
template<typename T>
int indexOfKey(T list[], int low, int high, T key)//在后面加int size
{
int low = 0;
int high = size - 1;//没有size参数...

if (low > high)
return -1 - low;
else
{
int mid = (low + high) / 2;
if (key > list[mid])
return indexOfKey(list, mid + 1, high, key);
else
return indexOfKey(list, low, mid + 1, key);
}
}

[ligangdili]

template<typename T>
int indexOfKey(T list[], T key, int size)
{
int low = 0;
int high = size - 1;
return indexOfKey(list, low, mid + 1, key);
}
中的mid从何而来?

[pstrunner]

编译应该不过吧。

[bluesky12312388]

return indexOfKey(list, low, mid + 1, key);
//mid从何而来?

[枫桦沐阳]

low high 重复定义 size - 1的size从何而来

int indexOfKey(T list[], int low, int high, T key)
{
int low = 0;
int high = size - 1;

mid是什么东西

return indexOfKey(list, low, mid + 1, key);

你的程序逻辑很简单，你把它编译过了基本上就成功了。。

[苍蝇①号]

#include <iostream>
#include <string>
using namespace std;

template<typename T>
int indexOfKey(T list[], int low, int high, T key);

template<typename T>
int indexOfKey(T list[], T key, int size);

int main()
{
        int list1[10] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
        int index1 = indexOfKey(list1, 2, 10);
        cout << "The index of the key is " << index1 << endl;

        double list2[10] = {1.2, 2.5, 3.1, 4, 5, 6, 7, 8.1, 9.5};
        int index2 = indexOfKey(list2, 8.1, 10);
        cout << "The index of the key is " << index2 << endl;

        string list3[4] = {"BeiJing", "ShangHai", "HuNan", "ChenZhou"};
        int index3 = indexOfKey(list3, string("BeiJing"), 4);
        cout << "The index of the key is " << index3 << endl;

        return 0;
}


        template<typename T>
int indexOfKey(T list[], int low, int high, T key)
{

        if (low > high)
                return -1 - low;
        else
        {
                int mid = (low + high) / 2;
                if (key > list[mid])
                        return indexOfKey(list, mid, high, key);
                else if(key==list[mid]){
                        return mid;
                }
                return indexOfKey(list, low, mid, key);
        }
}

        template<typename T>
int indexOfKey(T list[], T key, int size)
{
        int low = 0;
        int high = size - 1;
        return indexOfKey(list, low, high, key);
}

没有判断相等的情况，导致一直循环下去，死循环，最后导致栈溢出

[liuhex]

13楼正解