mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 13:31:07 +00:00
bc8df6de31
* [pre-commit.ci] pre-commit autoupdate updates: - [github.com/astral-sh/ruff-pre-commit: v0.2.2 → v0.3.2](https://github.com/astral-sh/ruff-pre-commit/compare/v0.2.2...v0.3.2) - [github.com/pre-commit/mirrors-mypy: v1.8.0 → v1.9.0](https://github.com/pre-commit/mirrors-mypy/compare/v1.8.0...v1.9.0) * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
27 lines
730 B
Python
27 lines
730 B
Python
#!/usr/bin/python
|
||
"""
|
||
The Fisher–Yates shuffle is an algorithm for generating a random permutation of a
|
||
finite sequence.
|
||
For more details visit
|
||
wikipedia/Fischer-Yates-Shuffle.
|
||
"""
|
||
|
||
import random
|
||
from typing import Any
|
||
|
||
|
||
def fisher_yates_shuffle(data: list) -> list[Any]:
|
||
for _ in range(len(data)):
|
||
a = random.randint(0, len(data) - 1)
|
||
b = random.randint(0, len(data) - 1)
|
||
data[a], data[b] = data[b], data[a]
|
||
return data
|
||
|
||
|
||
if __name__ == "__main__":
|
||
integers = [0, 1, 2, 3, 4, 5, 6, 7]
|
||
strings = ["python", "says", "hello", "!"]
|
||
print("Fisher-Yates Shuffle:")
|
||
print("List", integers, strings)
|
||
print("FY Shuffle", fisher_yates_shuffle(integers), fisher_yates_shuffle(strings))
|