This course introduces fundamental concepts in algorithm design, focusing on efficiency, optimization, and problem-solving techniques. Students will learn how to analyze algorithms using Big-O notation, explore different algorithm design paradigms (Divide & Conquer, Greedy, Dynamic Programming), and apply them to real-world software engineering challenges. By the end of the course, students will be able to design, analyze, and implement algorithms efficiently.
- استاد: Mohammad Hajarian