Describe the best- and worst-case running times for this pseudocode

NOTE*: This pseudocode is for an algorithm called MAX, that receives as input an array A[i . . j] of positive numbers and returns the index for largest number in A[i . . j]. Assume that i j and that there may be repeated numbers in the array.

123456SortByMax(A[1n])fori=1tonj=MAX(A[in])ifj=iswap(A[i],A[j])returnA[1n]