This repository contains implementations of various algorithms in C programming language. Below is a list of algorithms implemented:
- Max-min using divide and conquer
- Stassen’s matrix multiplication using divide and conquer
- Quick, merge sort using divide and conquer
- Single source shortest path Dijkstra's
- Activity selection problem
- Fractional knapsack
- Prim's algorithm
- Job sequencing with deadline
- Matrix chain multiplication
- All pair shortest path
- 0/1 knapsack problem
- Coin change problem using greedy and dynamic both
- LCS
- Bellman Ford algortihm
- OBST
- Hamiltonion cycle using backtracking
- Graph coloring using backtracking
- N queen using backtracking
- Rabin karp
- Naive string matching
- KMP algorithm