mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-12-18 01:00:15 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update quantum_bogo_sort.py line too long error resolved

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

20
sorts/quantum_bogo_sort.py
View File

@ -1,30 +1,30 @@
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.
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:
More info:
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.
:return: list[int] - The sorted list, humorously assumed to be
instantly sorted using quantum superposition.
Example:
>>> quantum_bogo_sort([2, 1, 4, 3])
[1, 2, 3, 4]
>>> quantum_bogo_sort([10, -1, 0])
[-1, 0, 10]
>>> quantum_bogo_sort([5])
[5]
>>> quantum_bogo_sort([])
[]
"""
return sorted(
arr
) # Sorting is assumed to be done instantly via quantum superposition
return sorted(arr) # Sorting is assumed to be done instantly via quantum superposition
if __name__ == "__main__":