Mi6: Write a binary search in python (✓ Sandbox Passed)

[psurabh]

Description

This pull request introduces a Python implementation of the binary search algorithm. The function binary_search takes a sorted list and a target value as input and returns the index of the target value in the list. If the target value is not found, the function returns None.

Summary

• Added a new file binary_search.py which contains the binary_search function.
• The binary_search function uses a while loop to perform the binary search.
• The function takes two arguments: a sorted list and a target value.
• The function returns the index of the target value if it is found in the list, otherwise it returns None.
• Included some test cases in the __main__ section of the script to demonstrate the functionality of the binary_search function.

Fixes #26.

---

🎉 Latest improvements to Mi6:

#

---

💡 To get Mi6 to edit this pull request, you can:

• Comment below, and MI6 can edit the entire PR
• Comment on a file, Mi6 will only modify the commented file
• Edit the original issue to get Mi6 to recreate the PR from scratch

[psurabh]

Rollback Files For Mi6

• [ ] Rollback changes to binary_search.py

This is an automated message generated by Mi6

[psurabh]

Apply to your PR?

• [ ] Apply: All new business logic should have corresponding unit tests.
• [ ] Apply: Refactor large functions to be more modular.
• [ ] Apply: Add docstrings to all functions and file headers.

This is an automated message generated by Mi6

[psurabh]

Apply to your PR?

• [ ] Apply: All new business logic should have corresponding unit tests.
• [ ] Apply: Refactor large functions to be more modular.
• [ ] Apply: Add docstrings to all functions and file headers.

This is an automated message generated by Mi6