Algorithms Repository

Overview

This repository contains a collection of algorithm implementations in C and C++ to solve various computational problems. These implementations are designed to aid learning, practice, and quick reference for fundamental algorithms.

---

Included Algorithms

Sorting Algorithms:

• Bubble Sort: Bubble Sort Implementation (C)
• Insertion Sort: Insertion Sort Implementation (C)
• Merge Sort: Merge Sort Implementation (C)
• Selection Sort: Selection Sort Implementation (C)

Searching Algorithms:

• Binary Search: Binary Search Implementation (C++)
• Linear Search: Linear Search Implementation (C)

Dynamic Programming Algorithms:

• Knapsack Problem: Knapsack Implementation (C)
• Longest Common Subsequence (LCS): LCS Implementation (C++)
• Longest Increasing Subsequence (LIS): LIS Implementation (C++)
• Longest Decreasing Subsequence (LDS): LDS Implementation (C++)

Greedy Algorithms:

• Coin Change Problem: Coin Change (Greedy) Implementation (C++)

---

How to Use

1. Clone the repository:

   git clone https://github.com/mahfuzur-mafu/Algorithms.git

2. Navigate to the directory:

   cd Algorithms

3. Compile and run the desired file. For example:

   gcc Bubble\ Sort.c -o BubbleSort
   ./BubbleSort

   For C++ files:

   g++ Binary\ Search.cpp -o BinarySearch
   ./BinarySearch

---

Contribution Guidelines

Contributions are welcome! If you'd like to add a new algorithm or improve the existing ones:

1. Fork the repository.
2. Create a feature branch:

   git checkout -b add-algorithm

3. Commit your changes:

   git commit -m "Added [algorithm_name] implementation"

4. Push to the branch:

   git push origin add-algorithm

5. Submit a Pull Request.