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 ... establishing ...

and how to use time and space complexity functions to compare similar algorithms. Once you’ve got these basics, you’ll be ready to learn about searching and sorting with one-dimensional arrays ...