private int[] Merge(int[] left_sorted, int[] right_sorted) {
		// TODO Auto-generated method stub
		int left_length = left_sorted.length;
		int right_length = right_sorted.length;
		int[] a = new int[left_length+right_length];
		
		int point_left = 0;
		int point_right = 0;
		int point_a = 0;
		while(point_left < left_length && point_right < right_length ){
			comparisons++;
			if(left_sorted[point_left] < right_sorted[point_right]){
				a[point_a] = left_sorted[point_left];
				point_left++;
				point_a++;
			}
			else if(left_sorted[point_left] > right_sorted[point_right]){
				a[point_a] = right_sorted[point_right];
				point_right++;
				point_a++;
			}
			else {
				a[point_a] = left_sorted[point_left];
				point_a++;
				point_left++;
				a[point_a] = right_sorted[point_right];
				point_right++;
				point_a++;
			}
		}
		while(point_left < left_length){
			a[point_a] = left_sorted[point_left];
			point_a++;
			point_left++;
		}
		while(point_right < right_length){
			a[point_a] = right_sorted[point_right];
			point_right++;
			point_a++;
		}
		return a;
	}