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

NOTE*: This pseudocode is for an algorithm that receives as input an array A[1 . . n] of numbers and returns the array A[1 . . n] sorted. There may be repeated numbers in A[1 . . n].

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