In this module the student will learn the very basics of algorithms through three examples: insertion sort (sort an array ... find its index; and merge sort (a faster method for sorting an array).