Scribd
Upload
9 views

Randomized Algorithms-April 2023-Handouts

The document discusses randomized algorithms, which employ randomness in their logic. It describes Las Vegas and Monte Carlo algorithms, and provides examples of randomized quicksort and estimating Pi using Monte Carlo simulation.

Uploaded by

DHAWAL SAKHARWADE
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
9 views

Randomized Algorithms-April 2023-Handouts

The document discusses randomized algorithms, which employ randomness in their logic. It describes Las Vegas and Monte Carlo algorithms, and provides examples of randomized quicksort and estimating Pi using Monte Carlo simulation.

Uploaded by

DHAWAL SAKHARWADE
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

Introduction to Randomized

Algorithms

Dr. Priyadarshan Dhabe,


Ph.D (IIT Bombay)
What is Randomness?
• A phenomenon or procedure for generating data is
random if
– the outcome is not predictable in advance;
• The probability of any outcome of a random
phenomenon must be between 0 and 1.
• The sum of probabilities of all the possible outcomes
associated with a particular random phenomenon
must add up to exactly 1.
What are randomized Algorithms?
• An algorithm that employs degree of randomness in part of
its logic.
• They uses uniformly random values to guide its behavior and
hoping for good performance in the average case using them.
• An algorithm that uses random number to decide what to do
next?, anywhere in its logic, is called randomized algorithm
e.g. randomized quick sort.
• In randomized quick sort pivot can be selected using random
number between 1 and n, hoping for better partitioning
(balanced one)
What are randomized Algorithms?

Output is decided by not only input but also using random number, also
called as probabilistic algorithms

Deterministic algorithms don’t use random numbers


Types of randomized Algorithms
Randomized
Algorithms

Las Vegas Monte Carlo


Algorithms Algorithms

Las Vegas is an internationally renowned major resort city, known primarily for its
GAMBLING, shopping, fine dining and entertainment, in Nevada state of USA- wiki
Laszlo Babai ,1979, is associated with Las Vegas and name the algorithm due to
randomness in gambling specifically, independent coin flipping experiment.

Monte Carlo is a famous casino in the costal area of France called Monaco. It is a
GAMBLING and entertainment complex-wiki
Invented by in 1947 by Nicholas Metropolis and named it due to randomness in
gambling in casino.
Types of randomized Algorithms
Las Vegas algorithm Monte Carlo Algorithm
It gives correct results or informs about Result may be incorrect with small
the failure to find solution. probability
Expected runtime may differ depending on Running time is certain or fixed
input but it is always finite.

// Monte Carlo algorithm


// Las Vegas algorithm Repeat 300 times:
repeat: k = RandInt(n)
k = RandInt(n) If A[k] == 1,
if A[k] == 1, return k;
return k; Return “failed”
A[1 to i-1] i A[i+1 to n]

Left part < x Right part > x

Bound to produce correct result and


execution time varies per run but finite
Randomized quick sort
• The runtime of QuickSort depends heavily on how
well the pivot is selected?
• If a value of pivot is either too big or small, the
partition will be unbalanced, resulting in a poor
runtime efficiency i.e O(n^2).
• However, if the value of pivot is near the middle of
the array, then the split will be reasonably well
balanced, yielding a faster runtime.
• Since the pivot is randomly picked, the running time
will be good most of the time and bad occasionally,
thus behavior can be O(n log n).
Estimating value of Pi using Monte Carlo simulation
• Assume we have a square of size 2r.

Asquare = (2r * 2r ) = 4r 2
• Draw a circle inside the square
with radius r r

2
Acircle = π * r 2r
• The ratio of area of circle to the
area of square is then

Acircle π * r 2 π
= 2
=
Asquare 4 * r 4
Estimating value of Pi using Monte Carlo simulation
Acircle π
=
Asquare 4
Multiplying both sides by 4 yields
Acircle π
4× = 4×
Asquare 4

Acircle
4× =π
Asquare
Acircle
∴π = 4 ×
Asquare
Estimating value of Pi using Monte Carlo simulation
• Draw many points randomly selected within the square, then,
the ratio can be approximated by
Acircle Number of points within the circle
≈
Asquare Number of points within the square

Acircle
π = 4×
Asquare

 Number of points within th e circle 


π ≈ 4 *  
 Number of points within th e square 
• As we draw more and more points randomly selected within
the square, the approximation will be better and better
Estimating value of Pi using Monte Carlo simulation
• Following are some of the estimated values of pi for the
randomly selected points in the square.
7
π = 4 * = 2.80 More the random
10 points better is
24 the approximation
π = 4* = 3.0967741935
31
48
π = 4* = 3.2542372881
59
112
π = 4* = 3.2463768116
138
490
π = 4* = 3.1818181818
616
https://www.youtube.com/watch?v=qcWg59jvqeA

You might also like