This is a Go implementation of the Bogosort sorting algorithm - probably the most inefficient of its kind. It sorts a slice by shuffling it till it's sorted 😅 Here's the Wikipedia entry for the Bogosort, if you want to read more about it.

Please don't.

There's a handy make test command if you'd like to run the unit tests