Floyd's Sampling Algorithm
Summary
A technical look at Floyd's sampling algorithm for selecting k elements from {1..n}, including code and two intuition paths: a combinatorial uniformity argument and a connection to the Fisher-Yates shuffle. The post situates the method among classic sampling techniques and provides references.