Codeforces EDU Binary Search Step 2 E, F

Hey guys. Last time we learned about discrete binary search and solved problem C and D. But last time our search space and answers consisted of integers only. This time we are dealing with real numbers. Now why that's a problem in binary search ? Because real numbers can be infinitely close to each other. More Practice Problems on Discrete Binary Search: SPOJ (AGGRCOW): https://www.spoj.com/problems/AGGRCOW/ SPOJ (EKO): https://www.spoj.com/problems/EKO/ SPOJ (PRATA): https://www.spoj.com/problems/PRATA/ Leetcode (Packages): https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/ Leetcode (Koko eating bananas): https://leetcode.com/problems/koko-eating-bananas/ Leetcode (Mutated Arrays): https://leetcode.com/problems/sum-of-mutated-array-closest-to-target/ Leetcode (Smallest Threshold divisor): https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/