This project uses d3.js and TypeScript to create visualizations of the following sorting algorithms:

• Bubble sort
• Selection sort
• Insertion sort
• Merge sort
• Quick sort
• Radix sort
• Bucket sort

You can visit the website here https://kluzko.github.io/Visualization-of-sorting-alogrithms

• first thing to change is make visualization more responsive so I can add bigger number of numbers (maybe 2500)
• add slider to adjust animation speed ( now is as fast as possible )

If you want to run project localy on your computer these are the steps:

1. Clone the repository
2. Run npm install to install the necessary dependencies
3. Run npm run dev then visit http://localhost:5173/

Select an algorithm from the dropdown menu and hit the "start" button to see the visualization in action. You can also change the amount of data so far from 50 to 500 numbers.

Warning This comparsion is only based on test on this website if you really want to test speed of this alogrithms you should delete await delay() witch is crucial for performance of vizualisation. For example with delay Radix Sort for 500 numbers is 22.15s but without this delay you get 0.75s ! So this is just to show you the speed comparison with these slowdowns.

Values are the average of 5 tests

Note These values may vary depending on your computer it also depends on how sorted numbers you get.

But as you can see Bubble Sort is very inefficent alogrithm.

To gain a deeper understanding of the sorting algorithms implemented in this project, please refer to the file.

If you find any issue, please open an issue or pull request. Also if you want to add any new algorithm or improve the existing algorithm please let me know.