Algorithm Visualizer

Algorithm Visualizer is an interactive platform designed to help learners understand the mechanics of popular algorithms, including sorting, searching, graph traversal, pathfinding, and recursion. The project is developed using React, TailwindCSS, and Vite, ensuring a fast and modern development experience.

---

Features

Sorting Algorithms

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

Searching Algorithms

• Linear Search
• Binary Search

Pathfinding Algorithms

• Dijkstra’s Algorithm
• Breadth-First Search (BFS)
• Depth-First Search (DFS)

Graph Algorithms

• Kruskal’s Minimum Spanning Tree (MST)
• Prim’s Minimum Spanning Tree (MST)
• Topological Sort

Recursion Visualizations

• Tower of Hanoi
• N-Queens Problem

---

Getting Started

Follow the steps below to set up and run the project locally.

1. Clone the Repository

git clone https://github.com/manishkumar8312/algorithm-visualizer.git
cd algorithm-visualizer

2. Install Dependencies

npm install

3. Start the Development Server

npm run dev

Open the application at: http://localhost:5173

---

Build for Production

To create an optimized production build:

npm run build

---

Technologies Used

| Category | Tools | | ------------------ | --------------- | | Frontend Framework | React 18 | | Styling | TailwindCSS | | Routing | React Router v6 | | Icons | Lucide Icons | | Build Tool | Vite |

---

Contributing

Contributions are welcome. To contribute:

1. Fork the repository
2. Create a feature branch (feature/new-algo)
3. Commit your changes
4. Open a Pull Request

---

Preview

---

License

This project is open-source and available under the MIT License. Created by Manish Kumar Sah.

---