private void merge(Comparable[] tempArray, int lower, int middle, int upper){
		int i = lower, j = middle +1;
		for (int k = lower; k <= upper; k++){
			aux[k] = tempArray[k];
		}
		for(int k = lower; k <= upper ; k++){
			if		(i > middle)							{tempArray[k] = aux[j++];}
			else if	(j > upper)								{tempArray[k] = aux[i++];}
			else if	(less(tempArray[j],aux[i]))				{tempArray[k] = aux[j++];}
			else 												{tempArray[k] = aux[i++];}
		}

	}