Write a function called mysort that rearranges elements of a
Write a function called mysort that rearranges elements of an array a so that they form an increasing sequence of values. Allow for different array positions to contain the same value.
Develop your own sorting algorithm; do not use a predefined sort routine from the standard library.
Implement a simple sorting algorithm rather than an efficient algorithm.
Write code that thoroughly tests your function. Express your tests using assertions.
Solution
Find the maximum element in an array which is first increasing and then decreasing
