public class NonRecursiveMergeSort {

	public T[] MergeSort(T[] M) {

		int length = M.length;
		int size = 1;
		int p;
		while (size < length) {
			p = -1;
			while (p + size < length) {
				int left = p + 1;
				int right = left + size - 1;
				if (right + size