mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-19 00:37:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update quantum_bogo_sort.py to include a reference to a wiki page

Browse Source
This commit is contained in:
Silicon27 2024-10-13 12:41:32 +02:00 committed by GitHub
parent 3064dd13a1
commit fc5411cd44
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 3 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
sorts/quantum_bogo_sort.py
View File

@ -4,6 +4,9 @@ def quantum_bogo_sort(arr: List[int]) -> List[int]:
"""
Quantum Bogo Sort is a theoretical sorting algorithm that uses quantum mechanics to sort the elements.
It is not practically feasible and is included here for humor.
Reference:
https://en.wikipedia.org/wiki/Bogosort#:~:text=achieve%20massive%20complexity.-,Quantum%20bogosort,-A%20hypothetical%20sorting
:param arr: List[int] - The list of numbers to sort.
:return: List[int] - The sorted list, humorously assumed to be instantly sorted using quantum superposition.