Challenge 10: Rearrange Sorted Array in Max/Min Form

Problem statement

Implement a function maxMin(int arr[], int size), which takes a sorted array arr and its size and will rearrange the elements of a sorted array such that the first position will have the largest number, the second will have the smallest, the third will have second largest, and so on. In other words, all the even-numbered indices will have the largest numbers in the array in descending order, and the odd-numbered indices will have the smallest numbers in ascending order.

The given array is sorted in ascending order.

Input

A sorted array and its size is given.

Output

The output is a list with elements stored in max/min form.

Sample input

arr = [1,2,3,4,5]

Sample output

arr = [5,1,4,2,3]