[CHALLENGE] Sorting algorithm interview question

Sort a (linked) list of integers, min to max.
1. You're only allowed to compare the first and second elements.

2. You can swap the first and second elements.

3. You can move the first element to the end of the list.

This was an interview question and supposedly isn't on the internet anywhere. Here was my attempt: https://play.golang.org/p/_hsRXFFkNl and the line-by-line output: http://pastebin.com/raw/c2wZSEpR

>>9
Do you know about the technique of intentional caching? Sometimes, you find that you can improve some kind of performance metric by caching computational results rather than computing the same calculations time and time again. The tradeoff is that caching data requires more memory space than if you dynamically calculated the data every time.