private void merge( int start, int mid, int end)
	{
		int i = start;
		int j = mid + 1;
		int k = start;
		
		while(i <= mid && j <= end)
		{
			if(number[i] < number[j])
			{
				temp[k] = number[i];
				k++;
				i++;
			}
			else
			{
				temp[k] = number[j];
				k++;
				j++;
			}
		}
		
		while(i <= mid)
		{
			temp[k] = number[i];
			k++;
			i++;
		}
		
		while(j <= end)
		{
			temp[k] = number[j];
			k++;
			j++;
		}
		
		
		for(i=k-1; i >= start; i--)
		{
			number[i] = temp[i];
		}
	}