Provide the following for insertion, selection, and quicksort:
- growth rate of the algorithm’s runtime as input size grows
- speed or number of comparisons and data movements of thealgorithm compared to the other algorithms
- changes (or lack thereof) in behavior of the algorithm fordifferent input orderings
Solution