This repository contains the project work completed for the course ECE 325 – Iterative Methods.
The projects focus on the design, implementation, and analysis of iterative algorithms across different problem domains.

The repository is structured so that each project is contained in its own subdirectory, along with a dedicated README describing the problem, algorithmic approach, correctness, and complexity analysis.

The course studies algorithmic techniques for solving computational problems using iterative methods.
Emphasis is placed on:

• Precise problem formulation
• Clear algorithm description
• Correctness arguments
• Efficiency analysis using asymptotic notation

Problems include search, decision, and optimization, solved using multiple algorithm design paradigms.

• Introduction to Iterative Algorithms
• Analysis of Algorithms (O, Ω, Θ)
• Brute Force and Exhaustive Search
• Divide and Conquer
• Fast Fourier Transform
• Decrease and Conquer
• Transformations
• Greedy Algorithms
• Dynamic Programming
• Iterative Improvement

Each assignment folder contains:

• Source code
• Supporting files (if any)
• A project-specific README.md describing:
  • Problem statement
  • Algorithmic approach
  • Correctness argument
  • Time and space complexity
  • Execution instructions

This repository serves as an academic archive and reference for algorithmic techniques taught in the course.
All implementations are intended for educational purposes.