Covers the fundamentals of algorithms and various algorithmic strategies, including time and space complexity, sorting algorithms, recurrence relations, divide and conquer algorithms, greedy ...

In this module the student will learn the very basics of algorithms ... bound on how the time taken to execute the algorithm grows as a function of input. The student is also exposed to the notion of ...