数据结构实验：实现插值和斐波那契查找

#include "Assistance.h" #include "binsearch.h" #include "FibonacciSearch.h" #include "InsertSearch.h" int main(void) { //int elem[] = { 8, 11, 23, 34, 39,43,46,48,50,56,60,67, 68, 71,75,83, 86 }; //int elem[] = { 1,16,24,35,47,59,62,73,88,99 }; //int elem[1500]; int elem[] = { 1,2, 3 ,4,5,6,7,8,9,10,11,12,13,14,15, 23, 34, 39,43,46,48,50,56,60,67, 68, 71,75,83, 86,2000, 2003, 2013, 2040, 2043,2046,2049,2050, 2052,2054,2057,2059,2070 }; //int elem[] = { 1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765,10946,17711,28657,46368 };//斐波那契数列 /*int elem[10000]; for (int i = 0; i < 10000; i++) elem[i] = i + 1;*/ /*for (int i = 0; i < 10; i++) elem[i] = i + 1; for (int i = 10; i < 100; i++) elem[i] = i + 1990; for (int i = 100; i < 1500; i++) elem[i] = i + 98999;*/ int elem1[SIZE]; int n = sizeof(elem)/4; for (int i = 0; i < n; i++) elem1[i] = elem[i]; //int k = 5; int k = 23; //迭代的折半查找 cout << "折半查找：" << endl; int count1 = 0, count2 = 0, count3 = 0; int p1 = BinSearch(elem, n, k, count1); if (p1 > 0) { cout << "查找成功,元素" << k << "的位置为: " << p1 << endl; cout << "比较次数为: " << count1 << endl << endl; } else // 查找失败 { cout << "查找失败!" << endl; cout << "比较次数为: " << count1 << endl << endl; } //斐波那契查找 cout << "斐波那契查找：" << endl; int p2 = FibonacciSearch(elem1, n, k, count2); if (p2 > 0) { cout << "查找成功,元素" << k << "的位置为: " << p2 << endl; cout << "比较次数为: " << count2 << endl << endl; } else // 查找失败 { cout << "查找失败!" << endl; cout << "比较次数为: " << count2 << endl << endl; } //插值查找 cout << "插值查找：" << endl; int p3 = InsertSearch(elem, n, k, count3); if (p3 > 0) { cout << "查找成功,元素" << k << "的位置为: " << p3 << endl; cout << "比较次数为: " << count3 << endl << endl; } else // 查找失败 { cout << "查找失败!" << endl; cout << "比较次数为: " << count3 << endl << endl; } system("PAUSE"); return 0; }