Learn Advanced Algorithms with these amazing books for free. Download it from the links given below.
Introduction to Algorithms: CLRS (Advanced)
Introduction to Algorithms by Thomas H. Cormen, Charles E. Leirson, Ronald L. Rivest, Clifford Stein is a comprehensive introduction to the modern study of computer algorithms. This book covers a wide range of algorithms in depth where each chapter is self-contained and presents an algorithm with it’s design techniques and application area along with some related topics. This is best suitable for self study by technical professionals as it discusses engineering issues in Algorithms as well as mathematical aspects.
Contents:
The book contains the following chapters:
- Revision History
- Getting Started
- Growth of Functions
- Divide-and-Conquer
- Probabilistic Analysis and Randomized Algorithms
- Heapsort
- Quicksort
- Sorting in Linear Time
- Medians and Order Statistics
- Hash Tables
- Binary Search Trees
- Red-Black Trees
- Augmenting Data Structures
- Dynamic Programming
- Greedy Algorithm
- Amortized Analysis
- Data Structures for Disjoint Sets
- Elementary Graph Algorithms
- Minimum Spanning Trees
- Single Source Shortest Paths
- All-Pairs Shortest Paths
- Maximum Flow
- Multithread Algorithms
Algorithms by Sedgwick (Moderate)
The book broadly covers treatments of data structures and algorithms for sorting, searching, graph processing, and string processing inclusive of fifty algorithms that every programmer must know. Obviously this books engages readers interest with clear and detailed examples with visuals and exercises at all level.
Contents:
Contents of this book are as follows:
- Fundamentals
- Basic Programming Model
- Data Abstraction
- Bags, Queues, and Stacks
- Analysis of Algorithms
- Case Study: Union-Find
- Sorting
- Elementary Sorts
- Mergesorts
- Quicksorts
- Priority Queues
- Applications
- Searching
- Symbol Tables
- Binary Search Trees
- Balanced Seach Trees
- Hash Tables
- Applications
- Graphs
- Undirected Graphs
- Directed Graphs
- Minimum Spanning Trees
- Shortest Paths
- Strings
- String Sorts
- Tries
- Substring Search
- Regular Expressions
- Data Compression
- Context
For more such free books related to programming Click Here.
