کتاب طراحی الگوریتم کورمن
کتاب طراحی الگوریتم کورمن
- Publisher : The MIT Press (March 1, 2013)
- Language : English
- Paperback : 240 pages
- english :language
- PDF :file
لینک‌هایی که باید ببینید:
- جهت مشاهده سایر کتاب‌ها کلیک کنید
- برای مشاوره رایگان کنکور (در تلگرام) پیام بدهید.
- .برای مشاهده ویدئو‌های آموزش و نکته و تست کنکور کامپیوتر کلیک کنید
خلاصه کتاب طراحی الگوریتم کورمن:
“Introduction to Algorithms” by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein (commonly referred to as “CLRS”) is a widely-used textbook on the design and analysis of algorithms. Here is a brief summary of some of the key concepts covered in the book:
Algorithm Analysis: The book begins with an introduction to algorithm analysis, including asymptotic notation, recurrence relations, and the master method.
Sorting and Order Statistics: The book covers several sorting algorithms, including insertion sort, merge sort, heapsort, and quicksort. It also covers order statistics algorithms, including selection and randomized selection.
Data Structures: The book covers a wide range of data structures, including arrays, linked lists, stacks, queues, trees, hash tables, and graphs.
Advanced Design and Analysis Techniques: The book covers advanced design and analysis techniques, including dynamic programming, greedy algorithms, and amortized analysis.
Advanced Data Structures: The book covers advanced data structures, including binary search trees, red-black trees, B-trees, Fibonacci heaps, and van Emde Boas trees.
Graph Algorithms: The book covers a wide range of graph algorithms, including breadth-first search, depth-first search, shortest paths, minimum spanning trees, and network flow.
Overall, “Introduction to Algorithms” is a comprehensive textbook that provides a thorough introduction to algorithmic thinking and covers a wide range of algorithms and algorithm design paradigms. The book is suitable for students and professionals in computer science, engineering, and related fields who are interested in the design and analysis of algorithms. It is often used as a textbook for undergraduate and graduate courses in algorithms and data structures.
:سرفصل ها
1 – What Are Algorithms and Why Should You Care?
2 – How to Describe and Evaluate Computer Algorithms
3 – Algorithms for Sorting and Searching
4 – A Lower Bound for Sorting and How to Beat It
5 – Directed Acyclic Graphs
6 – Shortest Paths
7 – Algorithms on Strings
8 – Foundations of Cryptography
9 – Data Compression
10 – Hard? Problems
دیدگاهتان را بنویسید