[Feature Request]: Add Binary Search Algorithm to PySnippets

[PeroxideParadox]

Is there an existing issue for this?

• [X] I have searched the existing issues

Feature Description

Description:

I propose adding a reusable Binary Search snippet to create a newAlgorithms category of PySnippets. Binary Search is a widely-used algorithm for searching in sorted arrays with a time complexity of O(log n), making it efficient for large datasets. This snippet will allow developers to quickly integrate a binary search function into their projects without reinventing the wheel, ensuring optimized performance for search operations in sorted data.

Why It's Useful:

• Performance Boost: Binary Search outperforms linear search in sorted arrays, making it a key tool for high-performance applications.
• Common Use Case: Often used in competitive programming, interview questions, and real-world applications like searching in databases or implementing search features in applications.
• Reusability: This snippet can be reused across a wide variety of problems that involve searching, including finding elements in sorted arrays, solving optimization problems, or even implementing binary search in continuous ranges (e.g., finding square roots).

Functionality:

The snippet will allow the user to search for an element in a sorted array and return its index, or -1 if not found. The function will handle both edge cases and invalid input, ensuring robust usage.

Test Cases:

• Search for an element that exists in the array.
• Search for an element that does not exist.
• Handle cases where the input is invalid, such as non-list types.

Record

• [X] I agree to follow this project's Code of Conduct
• [X] I want to work on this issue
• [X] I'm willing to provide further clarification or assistance if needed.

[github-actions[bot]]

🙌 Thank you for bringing this issue to our attention! We appreciate your input and will investigate it as soon as possible.

Feel free to join our community on Discord to discuss more!