fixed logical error in parameter "hi" the bisect functions of the bin…

[Nisarg-patel-2410]

Describe your change:

This update improves how the binary search function handles negative values passed to hi. Earlier, when hi was negative, the code reset it to len(sorted_collection), which ignored Python’s negative-index behavior.

The new logic adjusts hi by converting the negative index into its proper positive position. This makes the function behave more consistently with Python slicing rules.

What Changed

Added support for negative indexing in the hi parameter:

if hi < 0: hi = len(sorted_collection) + hi + 1

This ensures the search range is interpreted correctly when callers use negative indices.

• [ ] Add an algorithm?
• [x] Fix a bug or typo in an existing algorithm?
• [ ] Add or change doctests? -- Note: Please avoid changing both code and tests in a single pull request.
• [ ] Documentation change?

Checklist:

• [x] I have read CONTRIBUTING.md.
• [x] This pull request is all my own work -- I have not plagiarized.
• [x] I know that pull requests will not be merged if they fail the automated tests.
• [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
• [x] All new Python files are placed inside an existing directory.
• [x] All filenames are in all lowercase characters with no spaces or dashes.
• [x] All functions and variable names follow Python naming conventions.
• [x] All function parameters and return values are annotated with Python type hints.
• [x] All functions have doctests that pass the automated testing.
• [x] All new algorithms include at least one URL that points to Wikipedia or another similar explanation.
• [x] If this pull request resolves one or more open issues then the description above includes the issue number(s) with a closing keyword: "Fixes #ISSUE-NUMBER".