Introduction to Algorithms

Chapter #1

Searching Algorithms

Linear Search
Binary Search
Hashing
Interpolation Search
Exponential Search
Fibonacci Search
Ternary Search
Jump Search
Sublist Search
Overview and Comparison
Get started
Chapter #2

Sorting Algorithms

Bubble Sort
Selection Sort
Insertion Sort
Merge Sort
Quick Sort
Heap Sort
Radix Sort
Counting Sort
External Sort
Comparison
Get started
Chapter #3

Greedy Algorithms

Introduction to Greedy Algorithms
Greedy Algorithms for Optimization Problems
Greedy Algorithms for Shortest Path
Greedy Algorithms for Graphs
Applications of Greedy Algorithms
Greedy Algorithms in Real Life
Greedy Algorithms for Combinatorial Problems
Greedy Algorithms in Artificial Intelligence
Challenges and Pitfalls
Case Studies and Examples
Get started
Chapter #4

Dynamic Algorithms

Introduction to Dynamic Algorithms
Basics of Dynamic Programming
Dynamic Programming in Strings
Advanced Dynamic Programming Techniques
Optimization and Performance
Dynamic Programming in Graphs
Dynamic Programming Variants
Case Studies and Examples
Challenges and Pitfalls
Future Trends
Dynamic Programming in Trees
Get started
Chapter #5

Graph Algorithms

Introduction to Graphs
Breadth-First Search (BFS)
Depth-First Search (DFS)
Dijkstra's Algorithm
Bellman-Ford Algorithm
Kruskal's Algorithm
Network Flow Algorithms
Prim's Algorithm
Graph Traversal and Search
Get started
Chapter #6

Recursion Algorithms

Introduction to Recursion
Factorial and Fibonacci Series
Recursion with Trees and Graphs
Backtracking and Recursion
Divide and Conquer
Dynamic Programming and Recursion
Recursive Data Structures
Advanced Recursion Techniques
Get started
Chapter #7

Backtracking Algorithms

Introduction to Backtracking
Backtracking Algorithms
Sudoku Solver
Combinatorial Problems
Subset Sum Problem
Conclusion and Further Learning
Get started
Chapter #8

Divide and Conquer Algorithms

Introduction to Divide and Conquer Algorithms
Sorting Algorithms
Divide and Conquer on Arrays
Divide and Conquer on Trees
Divide and Conquer on Graphs
Divide and Conquer on Strings
Divide and Conquer on Numbers
Divide and Conquer on Dynamic Programming
Divide and Conquer on Geometric Problems
Get started