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

an insertion sort is not efficient for large lists, but is relatively fast for adding a small number of new items periodically. See sort algorithm. THIS DEFINITION IS FOR PERSONAL USE ONLY.