1. The Story: The Mission Briefing

"An archive of critical Labyrinth schematics is now sorted. You must find a specific file, but the archive is massive. Your old O(n) linear search is forbidden—it would trigger the security alarms. You must use a logarithmic approach."

2. The Problem

How do you find an item in a sorted array much faster?

3. The Task

You will implement Binary Search. The UI will visually show the huge search area being cut in half with every single check your code makes.

4. Concepts Applied

Binary Search.

5. Performance Debrief

The system awards a stellar "Efficiency Rating: O(log n)". It congratulates you: "Optimization complete. You have now mastered the single most important algorithm for searching sorted data. You are ready for more advanced tools."