← Upper Sixth › Computer Science › Applying searching and sorting techniques
🧩 Computer Science · Upper Sixth · Lesson 10

Searching Algorithms

Linear search checks items one by one; binary search halves a sorted list each step; hashing jumps straight to the item.

📘 Learn it

Short cards. Read them, then check your understanding below.

✍️ Check your understanding

Answer each activity and press Check. Wrong answers turn red. Press Show me if you are stuck.

Keep learning

Revise this chapter in the AsghinLabs Academy workbooks.

💬