Heapsort

Suppose you have written a sorting program following the heapsort algorithm that sorts an array in ascending order.

We have provided you with three arrays: $A$, $B$, and $C$ of the same length. $A$ is already sorted in ascending order, $B$ is sorted in descending order, and $C$ contains data in random order.

Apply your sorting program to all of these arrays and measure the working time. Finally, arrange the arrays in the order in which they are sorted, from fastest to slowest.