This project implements and vasualize shuffle and sorting algorithms. The process is being split into sequence first shuffle the array than sort the array finally check if the array is sorted. You can access through https://conradyen.github.io/Sorting-Shuffle-Visualizer/. Hope you enjoy play around with this project.
- merge sort
- quick sort
- bubble sort
- merge sort
- insertion sort
- selection sort and
- heap sort.
- Fisher yates shuffle
- Sattolo shuffle
- Naive shuffle.
In the project directory, you can run:
Install all dependencies of this project.
Runs the app in the development mode.
Open http://localhost:3000 to view it in the browser.
- The project idea is inspire by Clément Mihailescu sorting algorithm visualizer.