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

Like all complicated problems, there are many solutions that can achieve the same results, and one sort algorithm can re-sequence data faster than another. In the early 1960s, when magnetic tape ...

Trees, lists, stacks, queues, graphs, arrays, hash tables ... Examination of problem areas such as searching and sorting, and the indicated representations and algorithms. The student will use the ...