BogoSort Algorithm also known as permutation sort, stupid sort, slow sort, shotgun sort or monkey sort is a particularly ineffective sorting algorithm based on generating and test paradigm. The algorithm successively generates permutations of its input until it finds one that is sorted.

The average case time complexity is O((N+1)!) and the auxiliary space complexity is O(1) using linked lists.

Refer the article for more details and implementations.

Share your thoughts or ask any questions below.
This is a companion discussion topic for the original entry at http://iq.opengenus.org/bogo-sort/