Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-04-29 20:26:07 -04:00
Code Issues Packages Projects Releases Wiki Activity

Update README.md

Browse Source
This commit is contained in:
marina 2023-07-31 16:18:44 -07:00 committed by GitHub
parent 649a881647
commit 0963a43bcc
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 17 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
searching/README.md
View File

@ -1,2 +1,19 @@
## searching
<br>
### binary search
<br>
* a binary search operates on a contiguous sequence with a specified left and right index. this is called the search space.
* binary searching is composed of 3 sections:
* pre-processing: sort if collection is unsorted
* binary search: using a loop or recursion to divide search sapce in half after each comparison
* post-processing: determine viable candidates in the remaining space
* there are 3 "templates" when writing a binary search:
* `while left < right`, with `left = mid + 1` and `right = mid - 1`
* `while left < right`, with `left = mid + 1` and `right = mid`, and `left` is returned
* `while left + 1 < right`, with `left = 1` and `right = mid`, and `left` and `right` are returned