[Feature]: Binary Search in a Rotated Sorted Array

[yashksaini-coder]

Feature Name

Binary Search in a Rotated Sorted Array

Feature Description

Use a modified binary search to handle rotation. Perform a binary search with a check to determine if the left or right half is sorted. Decide the search direction based on which half contains the target, adjusting search bounds accordingly.

Motivation

This approach combines binary search with conditional checks to locate the target efficiently in a rotated array.

Implementation Suggestions (Optional)

No response

Feature Type

New Algorithm

Does this feature require additional resources?

• Additional Documentation
• Third-Party Libraries
• UI/UX Design
• Other

References (Optional)

No response

[yashksaini-coder]

@ajay-dhangar can you assign me this issue