Given two arrays with one array containing m elements sorted and another array of size m+n containing n elements sorted at beginning where the last m positions are empty, write code to merge these two sorted arrays efficiently so that u have the entire

Given two arrays with one array containing m elements sorted�

1.	Given two arrays with one array containing m elements sorted and another array of size m+n containing n elements sorted at beginning where the last m positions are empty, write code to merge these two sorted arrays efficiently so that u have the entire
Answer»