Where can I get the notes for the binary search lecture?
Please help.
Thank you.
Notes for the binary search lecture stl
There is no specific part for Binary Search as it is implemented In arrays.
For Standard Binary Search:
Topics:
STL of binary_search, lower bound, upper bound.
How binary search works
Standard Problem on Binary Search
- Painter Partition Problem
- Book allocation Problem
- Implement Power function.
You can easily find open blogs for these topics:
I m listing some of important links here.
STL
http://www.cplusplus.com/reference/algorithm/binary_search/
http://www.cplusplus.com/reference/algorithm/lower_bound/
How binary search works:
Standard Problems
.
.
.
.
.
.
Hit like if u get it