mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-04-18 03:37:35 +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:51:51 +00:00
parent 1aac36937e
commit b6fd43f29e
1 changed files with 11 additions and 9 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,32 @@
def quantum_bogo_sort(arr: list[int]) -> list[int]: def quantum_bogo_sort(arr: list[int]) -> list[int]:
""" """
Quantum Bogo Sort is a theoretical sorting algorithm that uses quantum Quantum Bogo Sort is a theoretical sorting algorithm that uses quantum
mechanics to sort the elements. It is not practically feasible and is mechanics to sort the elements. It is not practically feasible and is
included here for humor. included here for humor.
More info: More info:
https://en.wikipedia.org/wiki/Bogosort#:~:text=achieve%20massive%20complexity.-,Quantum%20bogosort,-A%20hypothetical%20sorting 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. :param arr: list[int] - The list of numbers to sort.
:return: list[int] - The sorted list, humorously assumed to be :return: list[int] - The sorted list, humorously assumed to be
instantly sorted using quantum superposition. instantly sorted using quantum superposition.
Example: Example:
>>> quantum_bogo_sort([2, 1, 4, 3]) >>> quantum_bogo_sort([2, 1, 4, 3])
[1, 2, 3, 4] [1, 2, 3, 4]
>>> quantum_bogo_sort([10, -1, 0]) >>> quantum_bogo_sort([10, -1, 0])
[-1, 0, 10] [-1, 0, 10]
>>> quantum_bogo_sort([5]) >>> quantum_bogo_sort([5])
[5] [5]
>>> quantum_bogo_sort([]) >>> 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__": if __name__ == "__main__":