An algorithm that uses random numbers to decide what to do next anywhere in its logic is called Randomized Algorithm. For example, in Randomized Quick Sort, we use random number to pick the next pivot (or we randomly shuffle the array). Typically, this randomness is used to reduce time complexity or space complexity in other standard algorithms.

Popular Articles on Randomized Algorithms
  1. Generate integer from 1 to 7 with equal probability
  2. Make a fair coin from a biased coin
  3. Shuffle a given array
  4. Reservoir Sampling
  5. Select a random number from stream, with O(1) space
  6. Random number generator in arbitrary probability distribution fashion
  7. Write a function that generates one of 3 numbers according to given probabilities
  8. K’th Smallest/Largest Element in Unsorted Array | Set 2 (Expected Linear Time)
  9. Birthday Paradox
  10. Linearity of Expectation
  11. Expected Number of Trials until Success
  12. Load Balancing on Servers (Randomized Algorithm)
  13. Karger’s algorithm for Minimum Cut | Set 1 (Introduction and Implementation)
  14. Select a Random Node from a Singly Linked List
  15. Karger’s algorithm for Minimum Cut | Set 2 (Analysis and Applications)
  16. Randomized Algorithms | Set 1 (Introduction and Analysis)
  17. Randomized Algorithms | Set 2 (Classification and Applications)
  18. Primality Test | Set 2 (Fermat Method)
  19. Randomized Algorithms | Set 3 (1/2 Approximate Median)
  20. Randomized Algorithms | Set 0 (Mathematical Background)
  21. Generate 0 and 1 with 25% and 75% probability
  22. Implement rand3() using rand2()

Ask a Question on Randomized Algorithms

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Company Wise Coding Practice    Topic Wise Coding Practice