#include <iostream>
using namespace std;
int find(int array[], int k, int size);
int main()
{
int array[7] = { 85,63,52,34,25,17,6 };
int k = 6;
int size = sizeof(array) / sizeof(int);
find(array, k, size);
}
int find(int array[], int k, int size)
{
int k1 = -1;
for (int n = 0; n < size; n++)
{
if (array[n] == k)
{
k1 = n;
break;
}
}
if (k1 >= 0)
{
cout << "该数据元素存在" << endl;
cout << "元素在数组物理下标位置为" <<k1 << endl;
cout << "元素在数组逻辑位置为" << k1 + 1 << endl;
}
if (k1 < 0)
{
cout << "该数据元素不存在" << endl;
}
return k1;
}