But insertion sort requires you to insert a new node, and moving of other nodes to accomodate the insert.
With just a swap, there is no inserting or moving of nodes...
Well that's how my mind worked anyway...
I guess we'll have to wait to see what the unisa lecturers say in the solution tutorial