DSA · Theory

Linear Search

← All stacks

Theory

45/810

Linear Search

Zara only reaches for Linear Search when find roll 12 has to stay correct in a sorted list.

Do Linear Search once by hand. linear vs binary. Change one input. Say the new result out loud.

Linear Search exists so Zara can keep find roll 12 correct in a sorted list.

Linear Search shows up in a sorted list. Name find roll 12, not “a real-world scenario”.

Linear Search miss — binary search on unsorted data. Fix it before you talk about advanced DSA.

Linear Search is not a lonely heading. Zara ties it to find roll 12.

One breath for Linear Search, then find roll 12, then binary search on unsorted data. Sit down.

Exam tip

Board: find roll 12. Dry-run Linear Search. Name the trap: binary search on unsorted data.

Example

def linear_search(arr, target):
    for i, x in enumerate(arr):
        if x == target:
            return i
    return -1

print(linear_search([4, 2, 9, 1], 9))

Linear search checks items one by one — O(n).

Short notes

DefLinear Search — Zara uses it for find roll 12 in a sorted list.
RuleLinear Search → linear vs binary.
RememberLinear Search + time vs memory (a sorted list).
UseLinear Search in a sorted list (find roll 12).
TrapLinear Search — binary search on unsorted data.
ExLinear Search → find roll 12.

DSA · Theory

Linear Search

← All stacks

Theory

45/810

Linear Search

Zara only reaches for Linear Search when find roll 12 has to stay correct in a sorted list.

Do Linear Search once by hand. linear vs binary. Change one input. Say the new result out loud.

Linear Search exists so Zara can keep find roll 12 correct in a sorted list.

Linear Search shows up in a sorted list. Name find roll 12, not “a real-world scenario”.

Linear Search miss — binary search on unsorted data. Fix it before you talk about advanced DSA.

Linear Search is not a lonely heading. Zara ties it to find roll 12.

One breath for Linear Search, then find roll 12, then binary search on unsorted data. Sit down.

Exam tip

Board: find roll 12. Dry-run Linear Search. Name the trap: binary search on unsorted data.

Example

def linear_search(arr, target):
    for i, x in enumerate(arr):
        if x == target:
            return i
    return -1

print(linear_search([4, 2, 9, 1], 9))

Linear search checks items one by one — O(n).

Short notes

DefLinear Search — Zara uses it for find roll 12 in a sorted list.
RuleLinear Search → linear vs binary.
RememberLinear Search + time vs memory (a sorted list).
UseLinear Search in a sorted list (find roll 12).
TrapLinear Search — binary search on unsorted data.
ExLinear Search → find roll 12.

Linear Search

Example

Short notes

Questions

Linear Search

Example

Short notes

Questions