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

In this example, the numbers to be added together are already held in a 1D array of five integer ... without need to store the values in an array, the algorithm is as follows.