import sys
import math
from collections import deque
input = sys.stdin.readline
t = int (input())
for i in range (t):
n = int (input())
inp = list ( map (int, input().split(' ')))
inp.sort()
arr = deque()
for i in inp:
arr.append(i)
ans = deque ()
while (len(arr)>1):
a = arr.pop()
b = arr.popleft()
ans.extendleft ([b,a])
if (len(arr)==1):
ans.appendleft(arr.pop())
print (*ans, sep=' ')
#include<bits/stdc++.h>
using namespace std;
int main(){
int t; cin>>t;
while(t--){
int n; cin>>n;
long long arr[n];
for(int i=0;i<n;i++) cin>>arr[i];
sort(arr,arr+n);
int ctr1=0,ctr2=n-1;
vector<int> ans;
while(ctr1<=ctr2){
if(ctr1==ctr2){
ans.push_back(arr[ctr1]);
break;
}
ans.push_back(arr[ctr1]);
ans.push_back(arr[ctr2]);
ctr1++; ctr2--;
}
reverse(ans.begin(),ans.end());
for(int i=0;i<n;i++) cout<<ans[i]<<" ";
cout<<endl;
}
}
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |