I'm doing an assignment, in which I'm reading the contents of a binary file, into a linked-list, which I then need to sort by customer code. At first, I was going to use a bubble-sort on the linked list, but after searching this board, it seemed that an insertion sort would be more appropriate.
However, I think I'm right in saying that I'd need a doubly-linked list to do this? I've only ever used a singly-linked list in the form of a stack, so I'm a little in the dark still. I think this is the correct theory though.
Just wondered if that was right or not and if I need to go and learn how to use a *prev pointer.