AlgoSketch is an algorithm visualizer application built using Next.js. This project provides visual representations of various sorting and path traversal algorithms, helping users to understand and explore their working principles.
- Frontend: Next.js
- Styling: Tailwind CSS
- State Management: Redux
- Merge Sort: Visualizes the divide-and-conquer approach of merge sort.
- Quick Sort: Demonstrates the partitioning process of quick sort.
- Selection Sort: Shows the selection and swapping process.
- Insertion Sort: Illustrates the process of building the sorted array one item at a time.
- Depth-First Search (DFS): Visualizes the backtracking method of DFS.
- Breadth-First Search (BFS): Demonstrates the level-order traversal of BFS.
- Dijkstra's Algorithm: Shows the shortest path algorithm using a priority queue.
- Sieve of Eratosthenes: Visualizes the ancient algorithm to find all primes up to a given limit.
- Netlify : https://algosketch.netlify.app
- Render : https://algosketch.onrender.com
- Docker Hub : https://hub.docker.com/r/shikhar7585/algosketch
git clone https://github.com/Poseidon0070/AlgoSketch- cd AlgoSketch
- npm install
- npm run dev
- npm run build
- npm start
git clone https://github.com/Poseidon0070/AlgoSketch- cd AlgoSketch
- docker compose up --build