title: insertion sort on a singly linked list
body: <p>Am i right in thinking that it is not possible to perform insertion sort on a singly linked list? </p>
  
  <p>My reasoning: assuming that <code>insertion sort</code> by definition means that, as we move to the right in the outer loop, we move to the left in the inner loop and shift values up (to the right) as required and insert our current value when done with the inner loop. As a result an SLL cannot accomodate such an algorithm. Correct?</p>