Linear search

# Self-authored for the EML case corpus (no external origin). Linear search
# over a fixed unsorted sample list — a single scanning loop with `break` on
# the first match — the natural counterpart to examples/binary-search/'s
# pre-sorted, divide-and-conquer approach. The sample list deliberately
# repeats one value (89) to demonstrate that linear search returns the
# *first* occurrence.

numbers^+[47, 12, 89, 3, 56, 23, 89, 71]

def linear_search(target):
    -1 => found_index
    for i in [0 : len(numbers) - 1]:
        if numbers[i] == target:
            i => found_index
            break
    return found_index

targets^+[56, 100, 47, 89, 71]
for target in targets:
    linear_search(target) => idx
    if idx >= 0:
        "Found " + str(target) + " at index " + str(idx) => msg
    else:
        str(target) + " not found" => msg
    msg^0

numbers = [47, 12, 89, 3, 56, 23, 89, 71]

def linear_search(target):
    found_index = -1
    for i in range(0, len(numbers)):
        if numbers[i] == target:
            found_index = i
            break
    return found_index

targets = [56, 100, 47, 89, 71]
for target in targets:
    idx = linear_search(target)
    if idx >= 0:
        msg = "Found " + str(target) + " at index " + str(idx)
    else:
        msg = str(target) + " not found"
    print(msg)

Found 56 at index 4
100 not found
Found 47 at index 0
Found 89 at index 2
Found 71 at index 7

Trace event types