In this module the student will learn the very basics of algorithms through three examples: insertion sort (sort an array in ascending/descending order); binary search: search whether an element is ...

What’s on CS111: The final covers programming basics, data structures, algorithms, recursion, and problem-solving, often through multiple-choice and coding questions. How to prepare: Review lectures ...