Provide correct answer with detailed explanation and don't copy from internet

C++ Language Please

Convert this iterative version a recursive version.

class SORT(arr)

k = arr.size

res = []

while k > 0

mIndex = max(arr[0] to arr[k])

maxIndex = mIndex - arr[0] + 1

res.push(maxIndex)

reverse(arr[0] to maxIndex)

res.push(k)

reverse(arr[0] to array[k])

k-=1

return res