Today I am going to ask you something weird.
In Algorithms Optimization, there are times where problems were faced with fun in mind. I want to bring you here one of this cases.
Meet the Crazy Sort
This sorting algorithm is very (very) particular : you have an infinite loop, and you want to sort an array. At each round of the loop, every item is swapped randomly with another one in the same array.
Your objective for today is to create a Golang version of this crazy algorithm.
Here some pseudocode to help you
loop until array is sorted swap randomly one element with another element