Competitive programming: Beginner

Sefism.

Chapter 04

Binary search

Searching sorted data with the STL, and the bigger idea: binary searching over the answer whenever a yes or no check is monotone.

5 concepts locked

Keep reading

8 more chapters, 48 more concepts, free with an account.

You have read the open chapters of the Competitive programming sheet. Every concept it covers is listed above, and an account opens the rest of them, the examples, the pitfalls and the whole library alongside it. Early access is open: sign up and your account is active shortly after.

Everything here is free to learn from. A few things, like adding a roadmap, keeping a cheat sheet or asking Tauseef a question, use credits. You get 15 when you join, your first roadmap is free, and if you are learning seriously and run out, you can ask for more. Credits only make sure the platform goes to people who are actually learning.

04 · Binary search4 / 11