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

[pre-commit.ci] auto fixes from pre-commit.com hooks

Browse Source 
for more information, see https://pre-commit.ci
This commit is contained in:
pre-commit-ci[bot] 2024-10-13 10:43:04 +00:00
parent fc5411cd44
commit 153009ea9e
1 changed files with 8 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
sorts/quantum_bogo_sort.py
View File

@ -1,10 +1,11 @@
from typing import List
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
@ -14,17 +15,19 @@ def quantum_bogo_sort(arr: List[int]) -> List[int]:
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__":