//Las Vegas algorithm
repeat:
k = RandInt(n)
if A[k] == 1,
return k;
//Monte Carlo algorithm
repeat 300 times:
k = RandInt(n)
if A[k] == 1
return k
return "Failed"
Someone says "it COULD be stuck for weeks"
It gets unstuck earlier, fine. Doesn't invalidate the possibility.
The criticism is moot. If anyone had made bets, then I'd take both more seriously.