حل المسائل مقدمه ای بر الگوریتم ها | زبان اصلی

• عنوان کتاب به فارسی: حل المسائل مقدمه ای بر الگوریتم ها
• عنوان کتاب به انگلیسی:  Introduction to algorithms
• نویسندگان: Thomas H. Cormen, Clara Lee, Erica Lin
• زبان: انگلیسی

» فهرست مطالب:

• Revision History R-1
• Preface P-1
• Chapter 2: Getting Started
• Lecture Notes 2-1
• Solutions 2-16
• Chapter 3: Growth of Functions
• Lecture Notes 3-1
• Solutions 3-7
• Chapter 4: Recurrences
• Lecture Notes 4-1
• Solutions 4-8
• Chapter 5: Probabilistic Analysis and Randomized Algorithms
• Lecture Notes 5-1
• Solutions 5-8
• Chapter 6: Heapsort
• Lecture Notes 6-1
• Solutions 6-10
• Chapter 7: Quicksort
• Lecture Notes 7-1
• Solutions 7-9
• Chapter 8: Sorting in Linear Time
• Lecture Notes 8-1
• Solutions 8-9
• Chapter 9: Medians and Order Statistics
• Lecture Notes 9-1
• Solutions 9-9
• Chapter 11: Hash Tables
• Lecture Notes 11-1
• Solutions 11-16
• Chapter 12: Binary Search Trees
• Lecture Notes 12-1
• Solutions 12-12
• Chapter 13: Red-Black Trees
• Lecture Notes 13-1
• Solutions 13-13
• Chapter 14: Augmenting Data Structures
• Lecture Notes 14-1
• Solutions 14-9
• Chapter 15: Dynamic Programming
• Lecture Notes 15-1
• Solutions 15-19
• Chapter 16: Greedy Algorithms
• Lecture Notes 16-1
• Solutions 16-9
• Chapter 17: Amortized Analysis
• Lecture Notes 17-1
• Solutions 17-14
• Chapter 21: Data Structures for Disjoint Sets
• Lecture Notes 21-1
• Solutions 21-6
• Chapter 22: Elementary Graph Algorithms
• Lecture Notes 22-1
• Solutions 22-12
• Chapter 23: Minimum Spanning Trees
• Lecture Notes 23-1
• Solutions 23-8
• Chapter 24: Single-Source Shortest Paths
• Lecture Notes 24-1
• Solutions 24-13
• Chapter 25: All-Pairs Shortest Paths
• Lecture Notes 25-1
• Solutions 25-8
• Chapter 26: Maximum Flow
• Lecture Notes 26-1
• Solutions 26-15
• Chapter 27: Sorting Networks
• Lecture Notes 27-1
• Solutions 27-8