The above inputs show how the two algorithms work in different real-life use cases. Time usage and memory consumption is measured. The first input is used as a control, as sorting algorithms often assume that the data is uniformly distributed. Sorting algorithms are often analyzed and tested using a uniform distribution [1]}. The second input is important to measure, since often the data is already sorted and the algorithm should still perform well.
