| Title | Recursive Binary Search |
| Catalog Type | SLCItem |
| Persistent ID | https://acos.cs.vt.edu/html/acos-pcex/acos-pcex-examples/py_search_binary_recursive__664e4b6991363872f0ba37c8?index=1 |
| Platform Name | PCEX |
| Features | — |
| Description | Construct a function that uses recursive binary search to find if a specific value is in a list (known as a "key"). Recall: Binary search uses the "Divide and Conquer" strategy. Given a list of ordered integers, the key is searched by dividing the data list in half and only searching in the half that contains the key, and repeating the process until the key is found and the index of the key is returned. If the key is not found, -1 is returned. |
| Keywords | — |
| Author | Mohammad Hassany |
| Institution | University of Pittsburgh |
| Iframe URL | https://acos.cs.vt.edu/html/acos-pcex/acos-pcex-examples/py_search_binary_recursive__664e4b6991363872f0ba37c8?index=1 |
| Protocol | SPLICE |
| Protocol URL | |
| License | MIT |
| Programming Language | PYTHON |
| Natural Language | en |