Is your feature request related to a problem? Please describe.
The Fisher-Yates shuffle, also known as the Knuth shuffle, is an algorithm used to randomly shuffle or permute the elements of an array or a list. It provides an unbiased and efficient way to generate a random permutation of the elements.
Describe the solution you'd like
The Fisher-Yates shuffle ensures that every possible permutation of the elements is equally likely to occur. It has a time complexity of O(n), where n is the number of elements in the array or list, making it efficient for shuffling large collections. i can code this in c,c++, python
Describe alternatives you've considered
A clear and concise description of any alternative solutions or features you've considered.
Additional context
please assign me this issue @Kumar-laxmi
Is your feature request related to a problem? Please describe. The Fisher-Yates shuffle, also known as the Knuth shuffle, is an algorithm used to randomly shuffle or permute the elements of an array or a list. It provides an unbiased and efficient way to generate a random permutation of the elements.
Describe the solution you'd like The Fisher-Yates shuffle ensures that every possible permutation of the elements is equally likely to occur. It has a time complexity of O(n), where n is the number of elements in the array or list, making it efficient for shuffling large collections. i can code this in c,c++, python
Describe alternatives you've considered A clear and concise description of any alternative solutions or features you've considered.
Additional context please assign me this issue @Kumar-laxmi