mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-23 21:11:08 +00:00
26 lines
729 B
Python
26 lines
729 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))
|