合并有序数组

#include<stdio.h>void merge(int A[], int m, int B[], int n){    while(m > 0 && n > 0) {        if(A[m - 1] > B[n - 1]) {            A[m + n - 1] = A[m - 1];            m--;        } else {            A[m + n - 1] = B[n - 1];            n--;        }    }    while(n > 0) {        A[m + n - 1] = B[n - 1];        n--;    }int i = 0;for(; i < 9; i++)printf("%d ", A[i]);printf("\n");}int main(void){    int a[9] = {1,3,5,7,9};    int b[4] = {2,4,6,8};    merge(a, 5, b, 4);    return 0;}