#include <bits/stdc++.h>
using namespace std;

const int oo = 2e5 + 3;
const int inf = 1e9;

int n;
int a[oo];

void solve() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	
	sort(a + 1, a + 1 + n);
	
	int d = inf;
	int pos1 = 0, pos2 = 0;
	for (int i = 1; i < n; i++) {
		if (a[i + 1] - a[i] < d) {
			d = a[i + 1] - a[i];
			pos1 = i;
			pos2 = i + 1;
		}
	}
	
	vector<int>res;
	res.push_back(a[pos1]);
	
	for (int i = 1; i <= n; i++) {
		if (i == pos1 || i == pos2) {
			continue;
		}
		
		if (a[i] >= a[pos1]) {
			res.push_back(a[i]);
		}
	}
	
	for (int i = 1; i <= n; i++) {
		if (i == pos1 || i == pos2) {
			continue;
		}
		
		if (a[i] < a[pos1]) {
			res.push_back(a[i]);
		}
	}
	
	res.push_back(a[pos2]);
	
	for (auto &x : res) {
		cout << x <<" ";
	}
	cout << '\n';
}

int main() {
	
	int t;
	cin >> t;
	while (t--) {
		solve();
	}
	
	return 0;
}