算法5--排序--Merge Sorted Array

之前几天在忙其他的事情，没有时间更新，今天更新了几个，虽然有几个SMR的博客暂时没有开放，已经写好了，以后会慢慢开放的

今天再更新一个有关排序的算法题

1  Merge Sorted Array
描述
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.

 

#include <stdio.h>


void mergetwosort(int a[],int m,int b[],int n)
{
    int len1=m-1;
    int len2=n-1;
    int len3=m+n-1;
    while(len1>=0&&len2>=0)
    {
        a[len3--]=a[len1]>b[len2]? a[len1--]:b[len2--];
    }
    while(len2>=0)
    {
        a[len3--]=b[len2--];
    }
}

int main()
{
    int a[4]={1,2,4,9};
    int b[7]={1,3,4,5,7,8,9};
    mergetwosort(a,4,b,7);
    for (int i = 0; i < 11; i++)
    {
        printf("%d ",a[i] );
    }
    return 0;
}