Data structure C language edition question set

2.20 reverse local configuration of the sequence table
Inverse_sqlist (INT arr [], size_t Len)
Algorithm : Exchange between the first half and the last half Void Inverse ( Int A [], size_t Len)
{
Assert (Len >   0 );
For ( Int I =   0 ; I < Len / 2 ; I ++ )
{
Swap (A [I], a [Len-1-I]);
}
}

2.21 reverse local configuration of a single-chain table
Inverse_linklist (linknode * head)
Algorithm: first disconnect the first node and the first node, and then insert each node into the first node (that is, 1st nodes)Inverse_linklist (linknode*Head)
{
Assert (Head! =Null&&Head->Next! =Null );

Linknode* Curptr, * Nextptr;
Curptr = Head -> Next;
While (Curptr ! = Null)
{
Nextptr = Curptr -> Next;

Curptr->Next=Head->Next;
Head->Next=Curptr;

Curptr=Nextptr;
}
}