merge sorted array(C++ code)

leetcode Merge Sorted ArrayMay 20 '12
Given two sorted integer arrays A and B, merge B into A as one sorted array.
Note:
You may assume that A has enough space to hold additional elements from B. The number of elements initialized in A and B are m and n respectively.

0. void merge(int A[], int m, int B[], int n) {  
1.   
2.        if(n == 0) return;  
3.   
4.        int i = m+n-1;  
5.   
6.       while(m > 0 && n > 0){  
7.   
8.            if(A[m-1] > B[n-1]) {A[i--] = A[m-- -1]; }  
9.   
10.            else{  
11.   
12.               A[i--] = B[n-- -1];   
13.   
14.            }  
15.   
16.       }   
17.   
18.      while(m > 0) {A[i--] = A[m-- -1]; }      
19.   
20.      while(n > 0) {A[i--] = B[n-- -1]; }   
21.   
22.        }