There are three methods you need to write: A recursive quick sort algorithm: Implement the algorithm exactly as discussed in class. If there are just two items to be sorted, swap them if necessary.

Most references introduce tree traversal using recursion only. Our literature survey indicated that most references only show the implementations of the recursive algorithms, and only few references ...

Recursion can make some algorithms easier to understand and implement ... For instance, recursion is often used to traverse trees, graphs, and other data structures that have a hierarchical ...

For simplicity, I chose to animate recursive functions using trees. Thanks to Drawing Presentable Trees and Improving Walker's Algorithm to Run in Linear Time articles I implemented Reingold-Tilford's ...