Question

This finding maximum number function will keep on going until we reach at the last value

Answer 1

In which algorithm first the maximum element is found and then placed at the end?
Heapsort algorithm
The Heapsort algorithm involves preparing the list by first turning it into a max heap. The algorithm then repeatedly swaps the first value of the list with the last value, decreasing the range of values considered in the heap operation by one, and sifting the new first value into its position in the heap.