Please write the algorithm in pseudocode using the following example

iLargest(A, n, i)

ithMax = Select(A, n-i) //finding the (n-i)-th smallest element in A

count = 0

temp[i]

//stores all elements that are greater than the i-th maximum element in temp

for j = 0 to n-1

if A[j] > ithMax

temp[count] = A[j]

count++

MergeSort(temp, 0, i)