MIT 6.S095 Programming for the Puzzled, IAP 2018 View the complete course: https://ocw.mit.edu/6-S095IAP18 Instructor: Srini Devadas Given a set of identical balls, you need to discover how high you can climb and drop a ball without the ball breaking. This video describes the algorithm and associated program to solve this problem while minimizing the number of required drops. License: Creative Commons BY-NC-SA More information at https://ocw.mit.edu/terms More courses at https://ocw.mit.edu/