Help, will rate!

Problem: we have an array of integers. Question: write an algorithm to make the array sorted in an increasing order.

You must use this decomposition idea: find the maximal integer in the array, swap it with the last integer in the array, sort the rest (except the last element) of the array. When finding the maximal integer in an array, you must use the function indexOfMax(A, bottom, top) whose inputs are an array A and numbers top and bottom and output is the index of a maximal number of A[bottom], A[bottom+1], , A[top].

Note you must follow the algorithm format used in class, and make your problem decomposition (divide and conquer) very clear (e.g., by comments). NO LOOP is allowed.