[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

It would make sense that it's "a" bubble sort.

Anyway, I realized that this is an impossible algorithm because you never know how to end it. I cheated by calling the length of the list (which requires accessing the memory after the second node, against the rules).