[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

>>8
I know this sounds retarded, but I was told that I cannot "use memory as a crutch for saving old values." Otherwise, yeah you're right, that's how you can do it.