a/usaco-guide
Archived
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Update 4_Silver_BinSearch.md

Browse source
This commit is contained in:
nchn27 2020-06-07 03:38:45 -04:00 committed by GitHub
parent 57a52aca14
commit a61606ee77
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

3
content/2_Silver/4_Silver_BinSearch.md
View file

@ -14,7 +14,7 @@ Binary search can be used on monotonic functions for a logarithmic runtime.
## The Basic Application
Find an element in a sorted array in O(log N) time.
"Find an element in a sorted array in O(log N) time." This is a very basic form of binary search. Other variations are similar, like "Given K, find the largest element less than K in a sorted array."
### Tutorial
- [GeeksForGeeks](https://www.geeksforgeeks.org/binary-search/)
- [Wikipedia](https://en.wikipedia.org/wiki/Binary_search_algorithm)
@ -30,6 +30,7 @@ Find an element in a sorted array in O(log N) time.
## Binary Searching on the Answer
Oftentimes used when you need to find the minimum or maximum of some quantity such that it satisfies some property.
### Tutorial
- [CPH Section 12.1](https://www.overleaf.com/project/5e73f65cde1d010001224d8a)
### Problems