Basic Algorithms i wrote during my Introduction to algorithms class
The following algorithms are implemented in either C or C++. There is no OOPs concept, so knowing only C will do fine.
Algorithms:
- Prim`s Minimum spanning tree
- Kruskal`s minimum spanning tree
- Assembly line problem
- Graph coloring problem
- Implementing Graph (Adjacency matrix)
- Single Source Shortest Path
- All Pairs Shortest Path (Using Dynamic Programming)
- N- Queens Problem
- Longest Common Sub-Sequence
- Matric Chain Multiplication
- Fractional Knapsack (Greedy)
- 0/1 Knapsack (Dynamic Programming)
- Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Heap Sort
- Radix Sort