Insertion sorting linked list

Insertion sorting linked list

Need to sort with insertions without swapping values(only pointers can be
changed). For every element ListElem from list: remove it from list
without deleting, and then scan list from beginning, and insert ListElem
to the right place. Help pls.
struct nod{
int num;
nod *next;
}
void InsertionSort(nod *head){
return;
}