Rearrange_array_alternatively.cpp

//{ Driver Code Starts
// C++ program to rearrange an array in minimum 
// maximum form 
#include <bits/stdc++.h>
using namespace std;


// } Driver Code Ends
class Solution{
    public:
    // This function wants you to modify the given input
    // array and no need to return anything
    // arr: input array
    // n: size of array
    //Function to rearrange  the array elements alternately.
    void rearrange(long long *arr, int n) 
    { 
        long long max_element = arr[n-1] + 1;
        int min_ind = 0;
        int max_ind = n -1;
        
        for(int i = 0; i < n; i++)
        {
            if(i % 2 == 0)
            {
                arr[i] += (arr[max_ind] % max_element) * max_element;
                max_ind--;
            }
            else
            {
                arr[i] += (arr[min_ind] % max_element) * max_element;
                min_ind++;
            }
        }
        for(int i = 0; i < n; i++)
            arr[i] /= max_element;
    }
};

//{ Driver Code Starts.

// Driver program to test above function 
int main() 
{
    int t;
    
    //testcases
    cin >> t;
    
    while(t--){
        
        //size of array
        int n;
        cin >> n;
        
        long long arr[n];
        
        //adding elements to the array
        for(int i = 0;i<n;i++){
            cin >> arr[i];
        }
        
        Solution ob;
        
        //calling rearrange() function
        ob.rearrange(arr, n);
        
        //printing the elements
        for (int i = 0; i < n; i++) 
		    cout << arr[i] << " ";
		
		cout << endl;
    }
	return 0; 
} 

// } Driver Code Ends