البحث الخطي

1def linear_search(a, target):2    # Scan left to right until the target appears3    for i in range(len(a)):4        if a[i] == target:5            return i6    return -17
8
9nums = [7, 3, 9, 1, 5, 8, 2]10print("Index of 5:", linear_search(nums, 5))11print("Index of 4:", linear_search(nums, 4))

1function linearSearch(a, target) {2    // Scan left to right until the target appears3    for (let i = 0; i < a.length; i++) {4        if (a[i] === target) return i;5    }6    return -1;7}8
9const nums = [7, 3, 9, 1, 5, 8, 2];10console.log("Index of 5:", linearSearch(nums, 5));11console.log("Index of 4:", linearSearch(nums, 4));

1public class Main {2    static int linearSearch(int[] a, int target) {3        // Scan left to right until the target appears4        for (int i = 0; i < a.length; i++) {5            if (a[i] == target) return i;6        }7        return -1;8    }9
10    public static void main(String[] args) {11        int[] nums = {7, 3, 9, 1, 5, 8, 2};12        System.out.println("Index of 5: " + linearSearch(nums, 5));13        System.out.println("Index of 4: " + linearSearch(nums, 4));14    }15}

1#include <iostream>2#include <vector>3
4int linearSearch(const std::vector<int>& a, int target) {5    // Scan left to right until the target appears6    for (std::size_t i = 0; i < a.size(); i++) {7        if (a[i] == target) return static_cast<int>(i);8    }9    return -1;10}11
12int main() {13    std::vector<int> nums = {7, 3, 9, 1, 5, 8, 2};14    std::cout << "Index of 5: " << linearSearch(nums, 5) << "\n";15    std::cout << "Index of 4: " << linearSearch(nums, 4) << "\n";16    return 0;17}

1#include <stdio.h>2
3int linear_search(const int a[], int n, int target) {4    /* Scan left to right until the target appears */5    for (int i = 0; i < n; i++) {6        if (a[i] == target) return i;7    }8    return -1;9}10
11int main(void) {12    int nums[] = {7, 3, 9, 1, 5, 8, 2};13    int n = sizeof(nums) / sizeof(nums[0]);14    printf("Index of 5: %d\n", linear_search(nums, n, 5));15    printf("Index of 4: %d\n", linear_search(nums, n, 4));16    return 0;17}

1DECLARE nums : ARRAY[1:7] OF INTEGER2DECLARE n : INTEGER3n ← 74nums[1] ← 75nums[2] ← 36nums[3] ← 97nums[4] ← 18nums[5] ← 59nums[6] ← 810nums[7] ← 211
12FUNCTION linearSearch(target : INTEGER) RETURNS INTEGER13    DECLARE i : INTEGER14    // Scan left to right until the target appears15    FOR i ← 1 TO n16        IF nums[i] = target THEN17            RETURN i18        ENDIF19    NEXT i20    RETURN -121ENDFUNCTION22
23OUTPUT "Index of 5 is ", linearSearch(5)24OUTPUT "Index of 4 is ", linearSearch(4)