hush! show me ur code!
#include<iostream>
using namespace std;
int orderfind(int * arr, int n,int key);//顺序
int betterorderfind(int *arr, int n, int key);//优顺序
int binaryfind(int *arr, int n, int key);//折半/二分
int insertfind(int *arr, int n, int key);//插值
int main() {
int a[10] = { 11, 25, 34, 44, 53, 63, 73, 80, 97, 107 };
cout << orderfind(a, 10, 44) << endl;
//cout << betterorderfind(a, 10, 44) << endl;//此方法改变了原数组。
cout << binaryfind(a, 10, 44) << endl;
cout << insertfind(a, 10, 44) << endl;
system("pause");
}
int orderfind(int * arr, int n,int key) {
for (int i = 0; i < n; i++){
if (arr[i] == key)
return i;
}
return -1;
}
int betterorderfind(int *arr, int n, int key){
if (arr[0] == key)
return 0;
else
arr[0] = key;
for (int i = n-1; i > 0; i--){
if (arr[i] == arr[0])
return i;
}
return 0;
}
int binaryfind(int *arr, int n, int key){
int low=0, mid, high=n-1;
do{
mid = (low + high) / 2;
if (key < arr[mid]){
high = mid - 1;
}
else if (key > arr[mid]){
low = mid + 1;
}
} while (arr[mid] != key);
return mid;
}
int insertfind(int *arr, int n, int key){
int low = 0, high = n - 1, mid;
do{
mid = low + ((high - low)*(key - arr[low]))/(arr[high]-arr[low]);
if (key > arr[mid])
low = mid + 1;
else if (key < arr[mid])
high = mid - 1;
} while (arr[mid] != key);
return mid;
}