📊 Matrix Optimization — Algorithm Benchmarking

Comparative study of algorithms for optimal matrix chain multiplication

---

📋 Overview

This project explores multiple approaches to solve the Matrix Chain Multiplication problem:

• 🔁 Backtracking (exact but slow)
• ✂️ Backtracking with pruning (optimized search)
• ⚡ Dynamic Programming (efficient optimal solution)

Goal: analyze performance, complexity, and scalability.

---

🏗️ Architecture

Instances Generator → Algorithms → Results → Analysis

🚀 Quick Start

# Compile
gcc -Wall solve_dp.c -o solve_dp.exe

# Generate instances
./generate_instances.c 1 10 50 gen_instances.txt

# Run
./solve_dp.exe gen_instances.txt output.txt

---

🛠️ Technologies