University of Cambridge > Talks.cam > UCCPS > Binge on Binary Search

  Browse A-Z

Log in

Googledetails Microsoftdetails

๐Ÿ” Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

โ„น๏ธ Information

Binge on Binary Search

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Room 9, Seminar time is 1pm BST in Room FW 11, Willam Gates Hall. Zoom link: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon Average on Saturdays: 7497.3030303 kWh

Other talks

Online Causal Inference Semina "That's History. That's Truth. I Seen It Myself": T'tc~tsa (Wailaki) and the Enslavement of California Native Americans. Animating urbanism: the demotic multiplicities of seeing cities digitally Understanding the Interplay between LLMs' Utilisation of Parametric and Contextual Knowledge Science & the Public in Action: Can and should climate scientists be activists? Harnessing Radical Reactivity for Molecular Innovation
 

ยฉ 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity