Algorithms and Data Structures 2

🌐 Contextualization

---

The main objective of the following repository is to show the codes developed in the discipline Algorithms and Data Structures 2.

The course that has been previously mentioned aims to discuss the different existing algorithms for the resolution of real world problems, focusing on their efficiency.

---

✴️ Paradigms of Algorithms Project Implemented

---

1. Divide and Conquer 🗺️

   • Maximum and Minimum
   • MergeSort
   • QuickSort

2. Dynamic Programming 📖

   • Fibonacci
   • Coins
   • Change
   • Integers Partition
   • Rod Cutting
   • LIS
   • LCS
   • Knapsack Problem
   • Knapsack Problem with Repetition
   • Minimum Edition Distance

3. Backtracking ♟

   • Arranges
     • Arranges with(out) Repetition ️
     • N Queens Problem
     • Sudoku
     • Circular Arranges
   • Combinations
     • Combinations with(out) Repetition
   • Subsets
     • All Subsets
     • Partition Subsets
     • Sum Subsets

4. Greedy Method ⚖️

   • Bottles and Pills
   • Knapsack Problem
   • Job Deadlines
   • Optimal Merge Pattern
   • Minimum Change
   • Tasks Selection
   • Minimum Segment Coverage