COT5407-Class04-2

# COT5407-Class04-2 - Probabilistic Analysis and Randomized...

This preview shows pages 1–7. Sign up to view the full content.

Probabilistic Analysis and Randomized Algorithm

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Average-Case Analysis In practice, many algorithms perform better than their worse case The average case is analyzed by Construct a probabilistic model of their input Determine the probabilities and running times (or costs) of alternate executions Calculate expected running time (or cost) COT5407
Example 1 COT5407

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Probabilistic Model Assume A has n distinct numbers. (What is the effect of duplicates?) Assume each permutation of the numbers is equally likely (How can we guarantee this? through randomization) How many permutations are there? What is the probability of the best case? What is the probability of the worst case? COT5407
Example 1: Analysis COT5407

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
We might not know the distribution of inputs, or we might not be able to model it computationally Instead we use randomization within the algorithm in order to impose a distribution on the inputs An algorithm is randomized if its behavior is
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 12/03/2011 for the course COT 5407 taught by Professor Staff during the Fall '08 term at FIU.

### Page1 / 12

COT5407-Class04-2 - Probabilistic Analysis and Randomized...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online