A randomized algorithm is an algorithm that employs a degree of randomness as part of its logic. Randomized algorithms are approximated using a pseudorandom number generator in place of a true source of random bits Example Quicksort, Verifying matrix multiplication. |

240 Using a random number to choose a pivot in quicksort | Write a program to find pivot item for the quick sort. | |

241 Verify matrix multiplication | Write a program for verifying matrix multiplication. | |

242 Smallest Enclosing Disk | Smallest Enclosing is used for computing the smallest circle that contains all of a given set of points in the Euclidean plane. | |

243 Reservoir Sampling | Reservoir sampling is a family of randomized algorithms for randomly choosing a sample of k items from a list S containing n items, where n is either a very large or unknown number. | |

244 Shuffle a given array | Write a program to randomly shuffle an Array |