C 作业帮助：搜索数组 [关闭]

搜索数组的自然语言生成文章

c
#include 
int linearSearch(int arr[], int n, int target) {
    for (int i = 0; i < n; i++) {
        if (arr[i] == target) {
            return i;  // 找到目标，返回索引
        }
    }
    return -1;  // 未找到目标，返回-1
}
int main() {
    int arr[] = {10, 20, 30, 40, 50};
    int n = sizeof(arr) / sizeof(arr[0]);
    int target = 30;
    
    int result = linearSearch(arr, n, target);
    
    if (result != -1) {
        printf("目标元素 %d 在数组中的索引是 %d%
", target, result);
    } else {
        printf("未找到目标元素 %d%
", target);
    }
    return 0;
}

c
#include 
int binarySearch(int arr[], int low, int high, int target) {
    while (low <= high) {
        int mid = low + (high - low) / 2;
        if (arr[mid] == target) {
            return mid;  // 找到目标，返回索引
        } else if (arr[mid] < target) {
            low = mid + 1;
        } else {
            high = mid - 1;
        }
    }
    return -1;  // 未找到目标，返回-1
}
int main() {
    int arr[] = {10, 20, 30, 40, 50};
    int n = sizeof(arr) / sizeof(arr[0]);
    int target = 30;
    
    int result = binarySearch(arr, 0, n - 1, target);
    
    if (result != -1) {
        printf("目标元素 %d 在数组中的索引是 %d%
", target, result);
    } else {
        printf("未找到目标元素 %d%
", target);
    }
    return 0;
}