Intelligent Design Sort or Quantum BogoSort

algorithm
sorting-algorithms
bogo-sort
quantum-bogo-sort

(Team) #1
Quantum Bogo Sort is a quantum sorting algorithm which can sort any list in O(1), using the "many worlds" interpretation of quantum mechanics.

The average case time complexity is O(1) and the auxiliary space complexity is O(1).

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/intelligent-design-sort/