Merge Sorted Array

Merge Sorted Array

Problem:

Given sorted integer arrays A and B, merge B into a as one sorted array.

Note:
You could assume that A have enough space (size that's greater or equal to m + n) to the hold additional Eleme NTS from B. The number of elements initialized in A and B is m andn respectively.

Ideas:

Merge sort finishing Work + just need to move then we'll come back.

My Code:

 Public classSolution { Public voidMergeintA[],intMintB[],intN) {if(A = =NULL|| B = =NULL|| M + n = = 0)return; intLast = m + n-1; inti = m-1, j = n-1;  while(I >= 0 && J >= 0)        {            if(A[i] >B[j]) {A[last--] = a[i--]; }            Else{a[last--] = b[j--]; }        }         while(I >= 0) A[last--] = a[i--];  while(J >= 0) A[last--] = b[j--]; return; }}

View Code

Merge Sorted Array