We analyze the expected run time because it represents the more typical
time cost. Also, we are doing the expected run time over the possible random-
ness used during computation because it can’t be produced adversatively, unlike
when doing expected run time over all possible inputs to the algorithm.