Skip to content

Commit 2dc6461

Browse files
committed
chore: binary search
1 parent 197dfa4 commit 2dc6461

File tree

1 file changed

+3
-2
lines changed

1 file changed

+3
-2
lines changed

‎README.md

+3-2
Original file line numberDiff line numberDiff line change
@@ -1207,16 +1207,17 @@ Binary Search is used to solve 2 kinds of problems:
12071207
### Binary Search Concept
12081208

12091209
- Watch [Code School Binary Search Videos](https://www.youtube.com/watch?v=j5uXyPJ0Pew&list=PL2_aWCzGMAwL3ldWlrii6YeLszojgH77j)
1210-
- Watch this [Binary Search conceptual video from Errichto and do problems](https://www.youtube.com/watch?v=GU7DpgHINWQ&list=PLl0KD3g-oDOHpWRyyGBUJ9jmul0lUOD80)
1210+
- Watch this [Binary Search conceptual video from Errichto](https://www.youtube.com/watch?v=GU7DpgHINWQ&list=PLl0KD3g-oDOHpWRyyGBUJ9jmul0lUOD80)
12111211

1212+
Next you have to solve some basic binary search problems.
12121213
### Binary Search Basic Problems
12131214

12141215
- Do all basics problems related to binary search [that I have given in this link](https://codepen.io/collection/vBORpO)
12151216
- Next do all below advanced problems
12161217

12171218
### Binary Search Advanced Questions
12181219

1219-
Below problems are lying under optimization problems. Just watch Book Allocation and Aggressive Cows videos to understand optimization logic. Once you understood them after that for rest problems you need to apply same logic.
1220+
Below problems are lying under optimization problems. Just watch Book Allocation and Aggressive Cows videos to understand optimization logic. Once you understood them after that for rest problems you need to apply same logic. Every iteration you reduce the search space by either maximizing or minimizing the solution.
12201221

12211222
- [Book Allocation](https://www.youtube.com/watch?v=Ss9ta1zmiZo&t=1335s)
12221223
- [Aggressive Cows](https://www.youtube.com/watch?v=TC6snf6KPdE)

0 commit comments

Comments
 (0)