AlgoVerse

This project is an interactive algorithm visualizer.

It focuses on greedy algorithms and dynamic programming.

You use it to see how algorithms work step by step.

You do not just read theory.

You watch decisions happen.

What the project does

• Visualizes algorithm execution in real time

• Highlights state changes at each step

• Compares greedy solutions against dynamic programming

• Shows where greedy succeeds and where it fails

Why this matters

Many students memorize algorithms.

Few understand decisions.

This tool closes that gap.

Core features

• Step by step animation with clear transitions

• Performance metrics

– Time complexity

– Space complexity

– Number of operations

• Educational focus with correct and incorrect cases

Available algorithms

• Knapsack problem

– Greedy vs DP comparison

– Shows why greedy gives wrong results

• Coin change

– Demonstrates greedy failure cases

• Interval scheduling

– Proves greedy optimality

Target users

You as a CS student.

Competitive programmers.

Anyone preparing for exams or interviews.

Technical value

• Turns abstract logic into visual states

• Improves intuition not memorization

• Helps you explain algorithms in interviews

Why this project stands out

Most tools show final answers.

This one shows thinking.

If you had this during your algorithms course

Would greedy and DP still feel confusing?