We’ll also explore algorithms most commonly used for sorting singly linked lists, and conclude with an example demonstrating the Insertion Sort algorithm.

For one thing, singly-linked lists restrict node traversal to a single direction: you can’t traverse a singly-linked list backward unless you first reverse its node links, which takes time.