Skip to content

Latest commit

 

History

History
34 lines (18 loc) · 1.51 KB

Ep1-Binary-Search.md

File metadata and controls

34 lines (18 loc) · 1.51 KB

Part 4 Episode 1/2: Binary + Ternary Search

Binary Search is one of the most powerful techniques that exist that can solve a variety of problems of even the highest difficulty. It is highly recommended that you truly understand the core concept behind Binary Search by reading the following tutorials:

  1. Tutorial on Binary Search

  2. Another Tutorial on Binary Search

  3. Iterative Binary Search using Jumps

Ternary Search is an extension of Binary Search that allows you to locate minima/maxima for Unimodal Functions.

Tutorial on Ternary Search


Here are some links to practice Binary Search problems:

  1. Codeforces 706 B

  2. Codeforces 492 B

  3. Codeforces 1352 C


Here are some links to practice Ternary Search problems:

  1. CodeChef ICM2003

  2. Codeforces 1479 A

  3. Codeforces 439 D