Jump to content

Knuth's algorithm S: Difference between revisions

(→‎{{header|Common Lisp}}: Marked for improvement as task function names have been ignored.)
Line 275:
elif random() < n / i:
# Keep item
del sample[randrange(n)] = item
sample.append(item)
return sample
return s_of_n
Anonymous user
Cookies help us deliver our services. By using our services, you agree to our use of cookies.