Write a function that generates one of 3 numbers according to given probabilities

Randomized Algorithms | Set 3 (1/2 Approximate Median)

Last Updated : 27 Mar, 2023

Time Complexity: We use a set provided by the STL in C++. In STL Set, insertion for each element takes O(log k). So for k insertions, time taken is O (k log k). Now replacing k with c log n =>O(c log n (log (clog n))) =>O (log n (log log n)) How is probability of error less than 2/n²? Algorithm makes an error if the set S has at least k/2 elements are from the Left Quarter or Right Quarter. median

median

It is quite easy to visualize this statement since the median which we report will be (k/2)th element and if we take k/2 elements from the left quarter(or right quarter) the median will be from the left quarter (or the right quarter). An array can be divided into 4 quarters each of size n/4. So P(selecting left quarter) is 1/4. So what is the probability that at least k/2 elements are from the Left Quarter or Right Quarter? This probability problem is same as below : Given a coin which gives HEADS with probability 1/4 and TAILS with 3/4. The coin is tossed k times. What is the probability that we get at least k/2 HEADS is less than or equal to?
Explanation:

probability

If we put k = c log n for c = 10, we get 
P <= (1/2)^{2log n}
P <= (1/2)^{log n²}
P <= n^-2

Probability of selecting at least k/2 elements from the left quarter) <= 1/n² Probability of selecting at least k/2 elements from the left or right quarter) <= 2/n² Therefore algorithm produces incorrect result with probability less than or equal to 2/n². References:www.cse.iitk.ac.in/users/sbaswana/CS648/Lecture-2-CS648.pptx

Write a function that generates one of 3 numbers according to given probabilities

C

Chirag Agarwal

Improve

Article Tags :

Similar Reads

Randomized Algorithms

Randomized algorithms in data structures and algorithms (DSA) are algorithms that use randomness in their computations to achieve a desired outcome. These algorithms introduce randomness to improve efficiency or simplify the algorithm design. By incorporating random choices into their processes, ran

Random Variable

Random variable is a fundamental concept in statistics that bridges the gap between theoretical probability and real-world data. A Random variable in statistics is a function that assigns a real value to an outcome in the sample space of a random experiment. For example: if you roll a die, you can a

Binomial Random Variables

In this post, we'll discuss Binomial Random Variables.Prerequisite : Random VariablesÂ A specific type of discrete random variable that counts how often a particular event occurs in a fixed number of tries or trials.Â For a variable to be a binomial random variable, ALL of the following conditions mus

Randomized Algorithms | Set 0 (Mathematical Background)

Conditional Probability Conditional probability P(A | B) indicates the probability of even 'A' happening given that the even B happened.P(A|B) = \frac{P(A\cap B)}{P(B)} We can easily understand above formula using below diagram. Since B has already happened, the sample space reduces to B. So the pro

Randomized Algorithms | Set 1 (Introduction and Analysis)

What is a Randomized Algorithm? An algorithm that uses random numbers to decide what to do next anywhere in its logic is called a Randomized Algorithm. For example, in Randomized Quick Sort, we use a random number to pick the next pivot (or we randomly shuffle the array). And in Karger's algorithm,

Randomized Algorithms | Set 2 (Classification and Applications)

We strongly recommend to refer below post as a prerequisite of this. Randomized Algorithms | Set 1 (Introduction and Analysis) Classification Randomized algorithms are classified in two categories. Las Vegas: A Las Vegas algorithm were introduced by Laszlo Babai in 1979. A Las Vegas algorithm is an

Randomized Algorithms | Set 3 (1/2 Approximate Median)

Time Complexity: We use a set provided by the STL in C++. In STL Set, insertion for each element takes O(log k). So for k insertions, time taken is O (k log k). Now replacing k with c log n =>O(c log n (log (clog n))) =>O (log n (log log n)) How is probability of error less than 2/n2? Algorithm make