CS255
Chris Pollett
Jan 26, 2022
We will now begin our investigation of randomized algorithms with a toy problem:
Hire-Assistant(n) 1 best := dummy candidate 2 for i := 1 to n 3 do interview of candidate i 4 if i is better than best 5 best := i 6 hire candidate i