Welcome to the Algorithms Code repository! This collection includes implementations of various standard algorithms in the C programming language. Feel free to explore the provided code for the following algorithms:
- Quicksort: Efficient sorting algorithm based on the divide-and-conquer approach.
- Heapsort: Sorting algorithm that uses a binary heap data structure.
- Activity Selection: Problem where the goal is to maximize the number of non-overlapping activities.
- Job Scheduling: Algorithm for scheduling jobs to maximize total profit.
- 0/1 Knapsack: Dynamic programming and greedy approaches to solve the knapsack problem.
- Rod Cutting: Finding the optimal way to cut a rod into pieces to maximize the total value.
- Optimal Binary Search Tree (OBST): Constructing a binary search tree with minimal expected search cost.
- Dijkstra's Algorithm: Finding the shortest path in a weighted graph.
- Fibonacci Series: Efficient computation of Fibonacci numbers.
- Coin Change Problem: Finding the minimum number of coins to make change for a given amount.
- Prim's Algorithm: Constructing a minimum spanning tree.
- Closest Pair of Points: Finding the pair of points with the smallest distance.
Feel free to explore the code, understand the algorithms, and use them as a reference for your projects. Happy coding!