University of Cambridge > > UCCPS > Binge on Binary Search

Binge on Binary Search

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Zak Smith.

Binary search is one of the most basic algorithms introduced to beginners in competitive programming. Most tutorials on binary search tend to focus on problems that directly apply the algorithm on arrays and do not go further. In this talk, we will look at common ways in which binary search and its variants can be used for solving a variety of problems beyond the obvious ones.

This talk is part of the UCCPS series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2022, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity