We can use the notion of expectations to characterize the running time of a randomized algorithm.
The expected running time is , where t is a possible running time for the algorithm and is the probability that this running time occurs.