CodePudding user response:

C has its own section, so there is more suitable,
This code algorithm, using a recursive method, moving a data bit at a time, this is not reasonable, n.m older, efficiency is a problem, have most invalid mobile ah,

CodePudding user response:

Can block replication:
Void fun (int a [], int n, int m)
{
Int * p;

If (n & gt; 0 & amp; & M & gt; 0 & amp; & N & gt; M)
{
P=(int *) malloc (m * sizeof (int));
Memmove (p, & amp; A [n - m], m * sizeof (int));
Memmove (& amp; A [m], & amp; A [0], (n, m) * sizeof (int));
Memmove (& amp; A [0], p, m * sizeof (int));
Free (p);
}
}