How many steps will be required for getting the final output for the following input?
Input: 97 85 66 49 73 28 138 25 115 74
8
Here the rule followed is:
Step I: The smallest number becomes first and the remaining numbers shift one position rightward. In case, the first number is small then the next number just larger than it will become second and the rest will shift one position rightward and so on.
Step II: The largest number among given numbers becomes last and the remaining numbers shift one position leftward. In case, the largest number is first from the right end, the second largest number replaces the second number from the right end, and so on.
These steps are repeated alternately till all the numbers get arranged in ascending order and that will be the last step for that particular input.