Otherwise we can generate a random number between 0 and b − a ... This is given by: Since we assume a = 0 in the first, the final running time is: O(lg(b-a)) But this algorithm is non-deterministic.

For example, a randomized algorithm for sorting a list of numbers might randomly pick a pivot element and partition the list around it, then repeat the process for the sublists. A randomized ...