Analysis-And-Design-Of-Algorithms

Repository for CENG218 course that I have taken at IZTECH

This course covers the fundamental algorithm analysis and design techniques.

Course Contents

1. Introduction
2. Asymptotic Notation
3. Divide and Conquer approach
4. Solving Recurrences
5. Divide and Conquer Algorithms
6. Quick Sort
7. Sorting in Linear Time
8. Hash Tables
9. Binary Search Trees
10. Balanced Search Trees
11. Dynamic Programming
12. Greedy Algorithms
13. Shortest Paths
14. Amortized Analysis and P-NP-NP Complete Problems

Click this link to go to Cormen's book (Introduction to Algorithms)