Figure 10.75 shows a routine to flip a coin, assuming that random returns an integer (which is prevalent in many systems). What is the expected performance of the skip list algorithms if the random number generator uses a modulus of the form M = 2B (which is unfortunately prevalent on many systems)?

Transcribed Image Text:

CoinSide flip( ) { if( ( random( ) % 2 ) == 0 ) 3 return HEADS; else return TAILS; }