#include <bits/stdc++.h>
using namespace std;
void selectionSort(vector<int> &a,int n){
for(int i = 0; i < n-1; i++){
int idx= i;
for(int j = i + 1;j < n; j++){
if( a[j] < a[idx]){
idx = j;
}
}
swap(a[i],a[idx]);
}
}
void solve() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
selectionSort(a,n);
int left = 0, right = n - 1;
vector<int> res;
while (left <= right) {
res.push_back(a[right--]);
if (left <= right) {
res.push_back(a[left++]);
}
}
for (int num : res) {
cout << num << " ";
}
cout << endl;
}
int main() {
int t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CnZvaWQgc2VsZWN0aW9uU29ydCh2ZWN0b3I8aW50PiAmYSxpbnQgbil7Cglmb3IoaW50IGkgPSAwOyBpIDwgbi0xOyBpKyspewoJCWludCBpZHg9IGk7CgkJZm9yKGludCBqID0gaSArIDE7aiA8IG47IGorKyl7CgkJCWlmKCBhW2pdIDwgYVtpZHhdKXsKCQkJCWlkeCA9IGo7CgkJCX0KCQl9CgkJc3dhcChhW2ldLGFbaWR4XSk7Cgl9Cn0Kdm9pZCBzb2x2ZSgpIHsKICAgIGludCBuOwogICAgY2luID4+IG47CiAgICB2ZWN0b3I8aW50PiBhKG4pOwogICAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIGNpbiA+PiBhW2ldOwogICAgc2VsZWN0aW9uU29ydChhLG4pOwogICAgaW50IGxlZnQgPSAwLCByaWdodCA9IG4gLSAxOwogICAgdmVjdG9yPGludD4gcmVzOwogICAgd2hpbGUgKGxlZnQgPD0gcmlnaHQpIHsKICAgICAgICByZXMucHVzaF9iYWNrKGFbcmlnaHQtLV0pOyAKICAgICAgICBpZiAobGVmdCA8PSByaWdodCkgewogICAgICAgICAgICByZXMucHVzaF9iYWNrKGFbbGVmdCsrXSk7IAogICAgICAgIH0KICAgIH0KICAgIGZvciAoaW50IG51bSA6IHJlcykgewogICAgICAgIGNvdXQgPDwgbnVtIDw8ICIgIjsKICAgIH0KICAgIGNvdXQgPDwgZW5kbDsKfQppbnQgbWFpbigpIHsKICAgIGludCB0OwogICAgY2luID4+IHQ7CiAgICB3aGlsZSAodC0tKSB7CiAgICAgICAgc29sdmUoKTsKICAgIH0KICAgIHJldHVybiAwOwp9Cg==