Insert Sort without new node creation
Insert Sort without new node creation

I change my solution to match the pdfs upon inspection.
I guessed there was a way to not use malloc but didn't immediately
see one.

Now I see how the next pointer is used to peek so that the list isn't lost.

wlaurance/c-practice