It would be cool to have animations for different sorting algorithms, for small and large n:
- Insertion sort
- Conventional quicksort
- 2-pivot quicksort
- timsort?
- merge sort? radix sort? These might be hard to do given our current treatment of memory...
Conveniently, sorting algorithms are bounded in time by O(n^2). So, for example, given a recursive sort algorithm, we can use the recursion depth as one array index, and the "real" sort array index as the other.
It would be cool to have animations for different sorting algorithms, for small and large n:
Conveniently, sorting algorithms are bounded in time by O(n^2). So, for example, given a recursive sort algorithm, we can use the recursion depth as one array index, and the "real" sort array index as the other.