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

deletion and finding the minimum element of a heap along with their time complexities. Finally, we will study the priority queue data structure and showcase some applications. We will go through the ...

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