🚀 AlgoVision

An interactive web application for visualizing Sorting Algorithms and Pathfinding Algorithms in real time. This project helps users understand how algorithms work through step-by-step animations, dynamic controls, and responsive visualizations.

---

✨ Features

📊 Sorting Visualizer

Visualize and compare popular sorting algorithms:

• Bubble Sort
• Selection Sort
• Insertion Sort
• Merge Sort
• Quick Sort

Features

• Adjustable array size
• Adjustable animation speed
• Generate random arrays
• Start, Pause, Resume, and Reset controls
• Real-time algorithm animation
• Dynamic algorithm information panel
• Time and space complexity display

---

🗺️ Pathfinding Visualizer

Visualize graph traversal and shortest path algorithms:

• Breadth First Search (BFS)
• Depth First Search (DFS)
• Dijkstra's Algorithm
• A* Search Algorithm

Features

• Interactive grid
• Draw and remove walls
• Random maze generation
• Clear path
• Clear grid
• Real-time pathfinding animation
• Dynamic algorithm information panel

---

🎨 User Interface

• Modern responsive design
• Dark mode support
• Mobile-friendly layout
• Smooth animations
• Interactive controls
• Professional dashboard-style UI

---

🛠️ Technologies Used

• HTML5
• CSS3
• JavaScript (ES6 Modules)

No external frameworks or libraries were used.

---

📁 Project Structure

AlgoVision/
│
├── assets/
│   └── screenshots/
│       ├── sorting-visualizer.png
│       ├── pathfinding-visualizer.png
│       └── darkmode-sorting.png
│
├── index.html
│
├── css/
│   ├── main.css
│   ├── sorting.css
│   ├── pathfinding.css
│   └── darkmode.css
│
├── js/
│   ├── app.js
│   ├── state.js
│   ├── sorting/
│   ├── pathfinding/
│   └── utils/
│
└── README.md

---

📈 Algorithm Complexities

Sorting Algorithms

Algorithm	Time Complexity	Space Complexity	Stable
Bubble Sort	O(n²)	O(1)	Yes
Selection Sort	O(n²)	O(1)	No
Insertion Sort	O(n²)	O(1)	Yes
Merge Sort	O(n log n)	O(n)	Yes
Quick Sort	O(n log n) Average	O(log n)	No

Pathfinding Algorithms

Algorithm	Complexity
BFS	O(V + E)
DFS	O(V + E)
Dijkstra	O((V + E) log V)
A*	O((V + E) log V)

---

🎯 Learning Objectives

This project was built to:

• Understand algorithm visualization
• Learn DOM manipulation
• Practice JavaScript animations
• Implement graph traversal algorithms
• Improve frontend architecture skills
• Build responsive user interfaces

---

📸 Screenshots

Pathfinding Visualizer

---

Sorting Visualizer

---

Dark Mode Support

---

👨‍💻 Author

Sumedh Mhatre

Built as a frontend algorithm visualization project using modern JavaScript and responsive web design principles.

---

⭐ Support

If you found this project useful, consider giving it a ⭐ on GitHub.