🔍 Searching Stick (SFML + C++)

Searching-Stick is a small SFML-based C++ program that visually demonstrates two classic searching algorithms: Linear Search and Binary Search. The array elements are represented as vertical "sticks", making it easier to understand how each algorithm operates step-by-step.

Github Link: https://github.com/Chintan-Patel-Games/Searching-Stick

🛠️ Technologies Used

• C++
• SFML (Simple and Fast Multimedia Library)

📚 Algorithms Demonstrated

• Linear Search – Scans each stick from left to right until the target is found.
• Binary Search – Efficiently searches a sorted array by repeatedly dividing the search range in half.

💡 Data Structure Used

• The sticks are stored in a dynamic array
• Each Stick is a custom struct that contains properties such as height and color, used for visualization.

🎮 Features

• Real-time visual feedback for search operations
• Highlights each step during the search
• Educational tool for beginners to understand search algorithms visually

📚 Concepts Demonstrated

• Linear Search
• Binary Search