First of all you should have the maximum size of second array as sum of size
of two arrays.
let size of 1st=k
and of 2nd = l
then for (i=k+l;i>=1;i--)
{
b[i]=b[l];
b[i-1]=a[k];
k--;l--;
}
Add some special cases.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
