public void mergeSort1(int[] inputArray) {
	        int size = inputArray.length;
	        if (size < 2)
	            return;
	        int mid = size / 2;
	        int leftSize = mid;
	        int rightSize = size - mid;
	        int[] left = new int[leftSize];
	        int[] right = new int[rightSize];
	        for (int i = 0; i < mid; i++) {
	            left[i] = inputArray[i];

	        }
	        for (int i = mid; i < size; i++) {
	            right[i - mid] = inputArray[i];
	        }
	        mergeSort1(left);
	        mergeSort1(right);
	        merge2(left, right, inputArray);
	    }