This commit is contained in:
2026-07-05 23:03:23 +02:00
parent b26c3d68a5
commit 5aca925a3e
20 changed files with 2578 additions and 1224 deletions
+18 -15
View File
@@ -2,33 +2,36 @@
![VALGO](image.png)
## 📊 Live Demo
## Live Demo
Check out the live demo [here](https://quinta0.github.io/valgo/).
## 🚀 About The Project
Algorithm Visualizer is an interactive web application designed to help users understand and visualize various sorting algorithms. Built with Next.js and React, this project aims to make learning algorithms more engaging and intuitive.
## About The Project
Valgo is an interactive, narrated visualizer for nine classic sorting algorithms, redesigned in a 3Blue1Brown-inspired style: a dark, grid-lined canvas, smooth per-step animation, a live "what's happening and why" commentary track, and a growth-curve chart that makes Big-O visually concrete.
### 🎯 Features
- Visualize multiple sorting algorithms in real-time
- Adjustable array size for different complexity scenarios
- Play, pause, and reset functionalities
- Detailed explanations for each algorithm
- Responsive design for various screen sizes
Every algorithm runs once, up front, recording a full sequence of steps (compare, swap, pivot selection, merge, bucket placement...). The player then replays that sequence at any speed, and can be paused or scrubbed like a video — nothing is re-computed on the fly.
### 🧮 Supported Algorithms
### Features
- Nine algorithms, each with color-coded state (comparing, swapping, pivot, sorted) and a sliding pointer that always shows where the algorithm is "looking"
- A synced narration panel explaining each step in plain language, in all 10 supported languages
- A growth-curve chart plotting O(n²), O(n log n), and O(n + k) side by side, with a live marker at the current array size
- Scrubbable timeline, adjustable speed, and live comparison/write counters
- Adjustable array size, shuffle, and reset
- Responsive, dark, 3Blue1Brown-inspired visual design
### Supported Algorithms
- Bubble Sort
- Insertion Sort
- Merge Sort
- Heap Sort
- Quick Sort
## 🛠️ Built With
## Built With
- [Next.js](https://nextjs.org/)
- [React](https://reactjs.org/)
- [TypeScript](https://www.typescriptlang.org/)
- [Tailwind CSS](https://tailwindcss.com/)
## 🏁 Getting Started
## Getting Started
To get a local copy up and running, follow these simple steps.
@@ -56,7 +59,7 @@ To get a local copy up and running, follow these simple steps.
```
5. Open [http://localhost:3000](http://localhost:3000) in your browser
### 🎨 Usage
### Usage
- Select a sorting algorithm from the dropdown menu.
- Adjust the array size using the slider if desired.
@@ -65,7 +68,7 @@ To get a local copy up and running, follow these simple steps.
- Click "Reset" to generate a new random array.
- Read the algorithm explanation provided below the visualization.
### 🤝 Contributing
### Contributing
Contributions are what make the open source community such an amazing place to learn, inspire, and create. Any contributions you make are greatly appreciated.
1. Fork the Project
@@ -74,6 +77,6 @@ Contributions are what make the open source community such an amazing place to l
4. Push to the Branch `git push origin feature/AmazingFeature`
5. Open a Pull Request
### 📝 License
### License
Distributed under the MIT License. See LICENSE for more information.