Correct lack of cohesiveness issues in the text.
In many cases, the space requirements for an algorithm can be drastically cut by using a randomized algorithm. Say we wish to know if two vertices in a graph of n vertices are in the same connected component of the graph.
In many cases, the space requirements for an algorithm can be drastically cut by using a randomized algorithm. For example, say we wish to know if two vertices in a graph of n vertices are in the same connected component of the graph.