This folder contains C programming implementations of various algorithms and problem-solving techniques.
- Sorting Algorithms: Bubble sort, quick sort, merge sort, heap sort
- Searching Algorithms: Linear search, binary search, depth-first search, breadth-first search
- Recursion Examples: Factorial, Fibonacci, tower of Hanoi
- Dynamic Programming: Memoization, tabulation examples
- Graph Algorithms: Shortest path, minimum spanning tree
- String Algorithms: Pattern matching, palindrome checking
- Mathematical Algorithms: Prime number generation, GCD, LCM
Use the format: algorithms_algorithmName.c
- ✅ Efficiency: Implement the most efficient version possible
- ✅ Time/Space Complexity: Include complexity analysis in comments
- ✅ Edge Cases: Handle edge cases and error conditions
- ✅ Documentation: Clear explanation of how the algorithm works
/*
* Algorithm: [Algorithm Name]
* Author: [Your Name]
* Date: [Date]
* Description: [Brief description of the algorithm]
*
* Time Complexity: O(n²)
* Space Complexity: O(1)
*
* Features:
* - [Feature 1]
* - [Feature 2]
*
* Usage: [How to compile and run]
*/Happy algorithm coding! 🚀