Essential Algorithms

Getting started
- Getting started with algorithm
- A sample algorithmic problem
- Getting Started with Simple Fizz Buzz Algorithm in Swift
Sorting
Bubble sort
- Bubble Sort
- Bubble Sort
- Implementation in C C
- Implementation in Javascript
- Implementation in C
- Implementation in Java
- Python Implementation
Algorithm complexity
- Algorithm Complexity
- Big-Theta notation
- Comparison of the asymptotic notations
- Big-Omega Notation
Graphs
- Introduction To Graph Theory
- Storing Graphs (Adjacency Matrix)
- Storing Graphs (Adjacency List)
- Topological Sort
- Detecting a cycle in a directed graph using Depth First Traversal
- Thorup's algorithm
Dynamic programming
- Dynamic Programming
- Longest Common Subsequence Explanation
- Edit Distance
- Longest Common Substring
- Weighted Job Scheduling Algorithm
- Longest Common Subsequence
- Fibonacci Number
- Knapsack Problem
Kruskals algorithm
- Kruskals Algorithm
- Optimal disjoint-set based implementation
- Simple more detailed implementation
- Simple disjoint-set based implementation
- Simple high level implementation
Greedy algorithms
- Greedy Algorithms
- Huffman Coding
- Activity Selection Problem
- Change-making problem
- Continuous knapsack problem
Searching
- Searching
- Binary Search
- Binary Search On Sorted Numbers
- Linear search
- Rabin Karp
- Analysis of Linear search (Worst, Average and Best Cases)
Big O notation
- Big-O Notation
- A Simple Loop
- A Nested Loop
- An Olog n example
- Olog n types of Algorithms
Bellman-For Algorithm
- BellmanFord Algorithm
- Single Source Shortest Path Algorithm (Given there is a negative cycle in a graph)
- Detecting Negative Cycle in a Graph
- Why do we need to relax all the edges at most V-1 times
Merge Sort
- Merge Sort
- Merge Sort Basics
- Merge Sort Implementation in Go
- Merge Sort Implementation in C C
- Merge Sort Implementation in Java
- Merge Sort Implementation in Python
- Bottoms-up Java Implementation
Binary Search Trees
- Binary Search Trees
- Binary Search Tree - Insertion (Python)
- Binary Search Tree - Deletion (C++)
- Lowest common ancestor in a BST
- Binary Search Tree - Python
Trees
- Trees
- Introduction
- Typical anary tree representation
- Check if two binary trees are same or not
Insertion Sort
- Insertion Sort
- Algorithm Basics
- Haskell Implementation
- C Implementation
Hash Functions
- Hash Functions
- Hash codes for common types in C
- Introduction to hash functions
Traveling Salesman
- Travelling Salesman
- Brute Force Algorithm
- Dynamic Programming Algorithm
Substring Search
- Substring Search
- Introduction To Knuth-Morris-Pratt KMP Algorithm
- Introduction to Rabin-Karp Algorithm
- KMP Algorithm in C
- Python Implementation of KMP algorithm.
Dijkstras Algorithm
- Dijkstras Algorithm
- Dijkstras Shortest Path Algorithm
Floyd-Warshall Algorithm
- Floyd-Warshall Algorithm
- All Pair Shortest Path Algorithm
Breadth-First Search
- Breadth-First Search
- Finding the Shortest Path from Source to other Nodes
- Finding Shortest Path from Source in a 2D graph
- Connected Components Of Undirected Graph Using BFS.
Bucket Sort
- Bucket Sort Basic Information
- C Implementation
Quicksort
- Quicksort
- Quicksort Basics
- Quicksort in Python
- Lomuto partition java implementation
- Haskell Implementation
- C Implementation
Depth-First Search
- Depth First Search
- Introduction To Depth-First Search
Knapsack Problem
- Knapsack Problem
- Knapsack Problem Basics
- Solution Implemented in C
Counting Sort
- Counting Sort
- Counting Sort Basic Information
- Psuedocode Implementation
- C Implementation
Cycle Sort
- Cycle Sort
- Pseudocode Implementation
- Cycle Sort Basic Information
- C Implementation
Heap Sort
- Heap Sort
- Heap Sort Basic Information
- C Implementation
Prims Algorithm
- Prims Algorithm
- Introduction To Prims Algorithm
Matrix Exponentiation
- Matrix Exponentiation
- Matrix Exponentiation to Solve Example Problems
Pigeonhole Sort
- Pigeonhole Sort
- Pigeonhole Sort Basic Information
- C Implementation
Radix Sort
- Radix Sort
- Radix Sort Basic Information
Equation Solving
- Equation Solving
- Linear Equation
- Non-Linear Equation
Odd-Even Sort
- Odd-Even Sort
- Odd-Even Sort Basic Information
Pseudocode
- Pseudocode
- Variable affectations
- Functions
Catalan Number Algorithm
- Catalan Number Algorithm
- Catalan Number Algorithm Basic Information
- C Implementation
Integer Partition Algorithm
- Basic Information of Integer Partition Algorithm
- Implementation of Interger Partition Algorithm in C
A* Pathfinding
- A Pathfinding
- Introduction to A*
- A* Pathfinding through a maze with no obstacles
- Solving 8-puzzle problem using A algorithm
Shell Sort
- Shell Sort
- Shell Sort Basic Information
- C Implementation
Selection Sort
- Selection Sort
- Selection Sort Basic Information
- Implementation of Selection sort in C
- Elixir Implementation
Pancake Sort
- Pancake Sort
- Pancake Sort Basic Information
- C Implementation
Longest Common Subsequence
- Longest Common Subsequence
- Longest Common Subsequence Explanation
Longest Increasing Subsequence
- Longest Increasing Subsequence
- Longest Increasing Subsequence Basic Information
- C Implementation
Maximum Path Sum Algorithm
- Maximum Path Sum Algorithm
- Maximum Path Sum Basic Information
- C Implementation
Maxiumum Subarray Algorithm
- Maximum Subarray Algorithm
- Maximum Subarray Algorithm Basic Information
- C Implementation
Dynamic Time Warping
- Dynamic Time Warping
- Introduction To Dynamic Time Warping
Pascal Triangle
- Pascal triangle in C
- Pascal's Triagle Basic Information
- Implementation of Pascals Triangle in C
Line drawing
- Line Algorithm
- Bresenham Line Drawing Algorithm
Shortest Common Supersequence
- Shortest Common Supersequence Problem
- Shortest Common Supersequence Problem Basic Information
- Implementation of Shortest Common Supersequence Problem in C
Sliding Window Algorithm
- Sliding Window Algorithm
- Sliding Window Algorithm Basic Information
- Implementation of Sliding Window Algorithm in C
Application of greedy techniqe
- Applications of Greedy technique
- Ticket automat
- Interval Scheduling
- Minimizing Lateness
- Offline Caching
Online algorithms
- Online algorithms
- Paging (Online Caching)
Fast Fourier Transform
- Fast Fourier Transform
- Radix 2 FFT
- Radix 2 Inverse FFT
A* Path-finding Algorithm
- A Pathfinding Algorithm
- Simple Example of A* Pathfinding: A maze with no obstacles
Check if tree is BST
- Algorithm to check if a given binary tree is BST
- If a given input tree follows Binary search tree property or not
Binary tree traversal
- Binary Tree traversals
- Level Order traversal - Implementation
- Pre-order Inorder and Post Order traversal of a Binary Tree
Lowest common ancestor of a binary tree
- Lowest common ancestor of a Binary Tree
- Finding lowest common ancestor
Graph Traversal
- Graph Traversals
- Depth First Search traversal function
Minimum Vertex Cover
- polynomial-time bounded algorithm for Minimum Vertex Cover
- Algorithm Pseudo Code
Multi-threaded Algorithms
- Multithreaded Algorithms
- Square matrix multiplication multithread
- Multiplication matrix vector multithread
- merge-sort multithread
Print MxN matrix in square wise
- Algo - Print a mn matrix in square wise
- Sample Example
- Write the generic code
Check two strings are anagrams
- Check two strings are anagrams
- Sample input and output
- Generic Code for Anagrams
Edit Distance Dynamic Algorithm
- Edit Distance Dynamic Algorithm
- Minimum Edits required to convert string 1 to string 2
Applications of Dynamic Programming
- Applications of Dynamic Programming
- Fibonacci Numbers
Knuth Moriss Pratt
- Knuth Morris Pratt KMP Algorithm
- KMP-Example
Contributors

Contents