Random Algorithms

Tags

comp-sci

An algorithm employing some [see page 27, randomness]. For example randomised quick-sort.

The advantage of randomised algorithms is that behaviour is consistent across all inputs, but the runtime of the algorithm isn't fixed from one invocation to the next.