QuickSortByNodeId(a, lo, hi); InsertionSortByNodeId(a, lo, hi);
IntroSortByNodeId(a, lo, hi, 2*(int)Math.floor(Math.log(hi-lo+1)/LOG2));
	public static void sortByNodeId(NodeProxy[] a, int lo, int hi) {		QuickSortByNodeId(a, lo, hi);		InsertionSortByNodeId(a, lo, hi);	}