Sort a (linked) list of integers, min to max.<p>1. You&#x27;re only allowed to compare the first and second elements.<p>2. You can swap the first and second elements.<p>3. You can move the first element to the end of the list.<p>This was an interview question and supposedly isn&#x27;t on the internet anywhere. Here was my attempt: https:&#x2F;&#x2F;play.golang.org&#x2F;p&#x2F;_hsRXFFkNl and the line-by-line output: http:&#x2F;&#x2F;pastebin.com&#x2F;raw&#x2F;c2wZSEpR
[Challenge] Sorting algorithm with constraints