A binary search implementation in Python
Project description
binarysearch_build
A simple implementation of binary search in Python.
Binary Search
Binary Search is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half.
Installation
- Make sure you have Python installed in your system.
- Run Following command in the CMD.
pip install search_binary
Usage
Here's an example of how to use the binary_search
function:
from search_binary import binary_search
arr = [1, 2, 3, 4, 5, 6, 7, 8, 9]
target = 5
result = binary_search(arr, target)
print(result) # Output: 4
The binary_search
function takes in two arguments: arr
and target
. The arr
argument is a list of sorted values, and the target
argument is the value you're searching for in the list. The function returns the index of the target value in the list, or -1
if the target value is not found.
Contributing
Contributions are welcome! If you'd like to contribute, simply fork the repository, make your changes, and submit a pull request.
License
This package is licensed under the MIT License. See the LICENSE
file for details.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Hashes for search_binary-0.0.1-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 1009f160bd23e2e9a8292fb324838eca673466eb326e126a2b75d3ec599b4f7e |
|
MD5 | b9b300186a339fd820f04883153953b5 |
|
BLAKE2b-256 | 83df8e76b5ce9f0a13a684956f10c91e41e4748986f688383c458f1b449218dd |