DSA · Theory

Searching

Theory

106/810

Searching is a DSA topic. In plain words you use it for find roll 12 in a sorted list. Don’t start with a slogan — start with that picture.

Smallest example: linear vs binary. Type it, run it, and say what you see. If you can do that from memory, you know Searching.

From the example next to this theory — Searching: dry-run [4, 1, 3].

Trap — binary search on unsorted data. Fix that before you talk about advanced DSA.

Viva — what is Searching? Then show linear vs binary. Then name the trap.

Exam tip

What is Searching? Show this: linear vs binary. Trap: binary search on unsorted data.

# Searching
data = [4, 1, 3]
print("start", data)
if data[0] > data[1]:
    data[0], data[1] = data[1], data[0]
print("after one step", data)

Searching: dry-run [4, 1, 3]. Say the list after one step.