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/