Cacher is the code snippet organizer for pro developers

/*
http://ideone.com/QqIPO2
http://www.practice.geeksforgeeks.org/problem-page.php?pid=408
http://qa.geeksforgeeks.org/6604/rearrange-an-array-in-maximum-minimum-form
*/

#include <iostream>
#include <string>
#include <vector>
using namespace std; 

int main() {
	int t, n;
	cin >> t;
	while(t--){
		cin >> n;
		int a[101], temp[101];
		for(int i=0; i<n; i++)
			cin >> a[i];
		
		int i=0, j=n-1;
		int idx = 0;
		while(i<j){
			temp[idx++] = a[j];
			temp[idx++] = a[i];
			j--;
			i++;
		}
		if(n & 1)
			temp[idx++] = a[i];
		
		for(int i=0; i<n; i++){
			a[i] = temp[i];
		}
		for(int i=0; i<n; i++){
			cout << a[i];
			cout << ((i==n-1) ? "\n" : " ");
		}
	}
	return 0;
}