Assertion: fisher yates shuffle | /r/CapableOf | assume constant time
Facets:
value: for fundamental steps
type: PURPOSE
Source sentences:
text: The Fisher–Yates shuffle, popularized by Donald Knuth, is simple (a few lines of code) and efficient (O(n) on an n-card deck, assuming constant time for fundamental steps) algorithm for doing this.
text: The Fisher–Yates shuffle, popularized by Donald Knuth, is simple (a few lines of code) and efficient (O(n) on an n-card deck, assuming constant time for fundamental steps) algorithm for doing this.