In the program shown in the lesson, at each step in the cycle, we found the smallest element in the range between the left point and the end of the array. Then we moved that element into its correct index position by switching the elements indicated. Change this C++ program so that it will find the LARGEST element instead. So, for example for the input 30 5 70 2, the cycles should work in the following way:

Run your C++ program on the following input: 70 40 5 1 -20 90 2

Write the C++ code

cycle given range 1 st and 3rd 30 5 702 30 5 2 70 25 30 70 0-3 0-2 0-1 by the end of the cycle 30 5 2 70 25 30 70 25 30 70