Creating one of the most common college projects, THE SORTING SIMULATOR.
chmod +x run.sh
./run.sh
- Genarate a randomly-arranged uniform distribution of numbers from 1 to 1000 (10^3).
- Draw them on a UI using a histogram.
- Redraw the histogram for every step of the sort.
These sorting algorithms are in scope for this --
- Selection Sort ⇒ O(N^2)
- Insertion sort ⇒ O(N^2)
- Bubble Sort ⇒ O(N^2)
- Merge Sort ⇒ O(N Log N)
- Quick Sort ⇒ O(N Log N)
- Heap Sort ⇒ O(N Log N)