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

You need to give them a search algorithm. There are lots of different ... it would take a long time. Binary searches are much faster. But they only work if the data is sorted in order.