Which of the following sorting algorithms has the lowest worst-case complexity?

In a binary max heap containing n numbers, the smallest element can be found in time

Which one of the following in place sorting algorithms needs the minimum number of swaps?

An element in an array X is called a leader if it is greater than all elements to the right of it in X. The best algorithm to find all leaders in an array