[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

>>3
The interviewer said "No" when I asked that same question. It cannot be bubble sort because copying the list or splitting up the list are against the rules.