mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 05:21:09 +00:00
24 lines
654 B
Python
24 lines
654 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
|
||
|
||
|
||
def FYshuffle(LIST):
|
||
for i in range(len(LIST)):
|
||
a = random.randint(0, len(LIST) - 1)
|
||
b = random.randint(0, len(LIST) - 1)
|
||
LIST[a], LIST[b] = LIST[b], LIST[a]
|
||
return LIST
|
||
|
||
|
||
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", FYshuffle(integers), FYshuffle(strings))
|