teaching

In CICS 160 (Intro to OOP), we covered binary search. I wanted the students to get a feel for the algorithm, and develop an intuitive understanding for the average-case performance of binary and linear search. I coded this small webpage (embedded below) to allow students to practice following the pseudocode of each algorithm. We used an in-class survey tool to visualize the results, allowing me to point out best, worst and average cases.

Note: the binary search webpage was artisanally coded (without the use of LLM-based coding tools).