public int[] merge(int[] a, int[] b) {
		int[] c = new int[a.length + b.length];
		
		int i =0;
		int j = 0;
		int index = 0;
		
		while(i < a.length  && j < b.length) {
			if (a[i] > b[j]) {
				c[index] = b[j];
				j++;
			} else {
				c[index] = a[i];
				i++;
			}
			
			index++;
		}
		
		if (i > a.length -1 && j < b.length) {
			for (;j <=b.length -1; j++) {
				c[index] = b[j];
				index++;
			}
		}
		if (j > b.length-1 && i < a.length) {
			for (; i <=a.length -1 ; i++) {
				c[index] =a[i];
				index++;
			}
		}
		return c;
	}