Interpolation Search

Interpolation Search 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 Interpolation Search.

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

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

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