What is a Randomized Algorithm?
An algorithm that uses random numbers to decide what to do next anywhere in its logic is called Randomized Algorithm.. For example, i...

Share

We strongly recommend to refer below post as a prerequisite of this.
Randomized Algorithms | Set 1 (Introduction and Analysis)
Classification
Randomized algorithms ar...

Share

Conditional Probability Conditional probability P(A | B) indicates the probability of even ‘A’ happening given that the even B happened.
We can easily...

Share

We strongly recommend to refer below articles as a prerequisite of this.
Randomized Algorithms | Set 1 (Introduction and Analysis)
Randomized Algorithms | Set 2 (Clas...

Share

Consider a high traffic website that receives millions of requests (of different types) per five minutes, the site has k (for example n = 1000) servers to process the...

Share

We are given a sorted array A[] of n elements. We need to find if x is present in A or not.In binary search we always used middle element, here we will randomly pick ...

Share

Like Red-Black and AVL Trees, Treap is a Balanced Binary Search Tree, but not guaranteed to have height as O(Log n). The idea is to use Randomization and Binary Heap ...

Share