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

Although these questions appear to be very far apart in terms of scale, they share a common attribute: complexity. Conventional mathematics – as developed over the last two millennia – is good at ...

The student is also exposed to the notion of a faster algorithm and asymptotic complexity through the O, big-Omega and big-Theta notations. In this module, the student will learn about the basics of ...