Given an array of $n$ distinct numbers that is already sorted in ascending order, determine the running time of applying different sorting algorithms to sort it into ascending order.

What will be the running

time of Hoare$-$Quicksort?

$(1)$

What will be the running time of Lomuto$-$Quicksort?

$(n)$

What will be the running time of Merge Sort?

What will be the running

$(nlogn)$ time of sorting using binary search tree?

What will be the running

time of Heapsort?

$(n^2)$