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

Development of more sophisticated ideas in data type and structure, with an introduction to the connection between data structures and the algorithms they support ... correctness and estimating time ...

Through these algorithms the student will be introduced to the analysis ... on how the time taken to execute the algorithm grows as a function of input. The student is also exposed to the notion of a ...