feat: add range-based binary search using boolean predicate

[AkarshanGupta]

Description

This PR adds a generalized binary search implementation that operates over a numeric range using a monotonic boolean predicate, instead of searching for a concrete value in an array.

The existing binary search implementation was limited to exact value lookup. This enhancement abstracts the core logic, allowing the same binary search mechanism to be reused across multiple problem domains.

The original implementations remain unchanged to preserve backward compatibility.

---

Key Features

• Algorithm: Generalized Binary Search (predicate-based)
• Input: Search range [low, high] and a boolean predicate function f(x)
• Output: Smallest value x such that f(x) returns true
• Complexity:
  • Time: O(log N)
  • Space: O(1)
• Reusability: Enables binary search for optimization problems, boundary finding, and non-array-based use cases
• Documentation: README updated to describe the new utility

---

Contribution Type

• New Algorithm
• Bug Fix
• Documentation Update

---

Additional Notes

This abstraction directly addresses the discussion in the linked issue and lays the groundwork for applying similar generalizations to other algorithms in the repository.

Closes #2703