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

written descriptions and program code. There are also some standard algorithms for searching and sorting. Further algorithms - Edexcel Programs must run correctly or they are of little value.

sorting algorithms, optimization problems and complexity analysis. The course includes a significant practical component covering the implementation and application of important data structures and ...

running time and correctness of an algorithm. Recursion. Data structures: arrays, linked lists, stacks, queues, binary search trees. Sorting algorithms. Greedy algorithms. Dynamic programming. This ...