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 it is presumed that the array/list has already been populated. In this example a label is used to output the result. It is possible to use other objects for output.