DSA · Theory

Difference between Linear Search and Binary Search

Theory

69/810

Difference between Linear Search and Binary Search

Difference between Linear Search and Binary Search sits in a file explorer. Farhan’s job is folder on disk. Write that first.

Difference between Linear Search and Binary Search on the board: left < root < right. Then say what folder on disk looks like after.

Difference between Linear Search and Binary Search exists so Farhan can keep folder on disk correct in a file explorer.

Use Difference between Linear Search and Binary Search when folder on disk must stay clear. If a simpler DSA step works, use that instead.

If folder on disk breaks under Difference between Linear Search and Binary Search, check unbalanced BST becoming a list first.

After Difference between Linear Search and Binary Search, Farhan should still remember unbalanced BST becoming a list.

Close Difference between Linear Search and Binary Search with: “If I skip it, folder on disk goes wrong like this: unbalanced BST becoming a list.”

Diagram

  [2, 5, 8, 12, 20]  find 12
         mid=8 → right
              mid=12 found

Exam tip

Board: folder on disk. Dry-run Difference between Linear Search and Binary Search. Name the trap: unbalanced BST becoming a list.

Example

def binary_search(arr, target):
    lo, hi = 0, len(arr) - 1
    while lo <= hi:
        mid = (lo + hi) // 2
        if arr[mid] == target:
            return mid
        if arr[mid] < target:
            lo = mid + 1
        else:
            hi = mid - 1
    return -1

print(binary_search([1, 3, 5, 7, 9], 7))

Difference between Linear Search and Binary Search — binary search halves a sorted array each step — O(log n).

Short notes

DefDifference between Linear Search and Binary Search — Farhan uses it for folder on disk in a file explorer.
RuleDifference between Linear Search and Binary Search → left < root < right.
RememberDifference between Linear Search and Binary Search + Big-O (a file explorer).
UseDifference between Linear Search and Binary Search in a file explorer (folder on disk).
TrapDifference between Linear Search and Binary Search — unbalanced BST becoming a list.
ExDifference between Linear Search and Binary Search → folder on disk.

def binary_search(arr, target): lo, hi = 0, len(arr) - 1 while lo <= hi: mid = (lo + hi) // 2 if arr[mid] == target: return mid if arr[mid] < target: lo = mid + 1 else: hi = mid - 1 return -1 print(binary_search([1, 3, 5, 7, 9], 7))

Difference between Linear Search and Binary Search

Example

Short notes

Questions

Difference between Linear Search and Binary Search

Example

Short notes

Questions