编辑代码

#include <iostream>
using namespace std;

int main() {
    int data[] = {85, 63, 52, 34, 25, 17, 6};
    int target = 6;
    int foundIndex = -1;
    int dataSize = sizeof(data) / sizeof(data[0]);

    for (int i = 0; i < dataSize; ++i) {
        if (data[i] == target) {
            foundIndex = i;
            break;
        }
    }

    if (foundIndex != -1) {
        cout << "元素 " << target << " 存在于数组的索引 " << foundIndex << " 处。" << endl;
        cout << "逻辑位置为: " << foundIndex + 1 << endl;
    } else {
        cout << "元素 " << target << " 不在数组中。" << endl;
    }

    return 0;
}