algorithm-notes
  • Preface
  • Outline
    • Asymptotic-Analysis
    • Divide-and-Conquer (DnC)
      • Overview
      • Multiplication
      • DnC Strategy
      • Master Method
    • Randomization
      • Overview
      • Discrete Probability
      • Randomized Algorithms
      • Reservoir Sampling
    • Sorting
      • Overview
      • Selection Sort
      • Bubble Sort
      • Insertion Sort
      • Shell Sort
      • Merge Sort
      • Heap Sort
      • Quick Sort
      • Non-Comparison Sort
    • Graph Algorithms
      • Overview
      • Minimum Spanning Tree
      • Shortest Path
      • Topological Sort
    • Tree
      • Overview
      • Balanced Search Tree
        • AVL Tree
        • Red-Black Tree
        • B Tree
      • Heap
      • Disjoint Set
      • Threaded Binary Tree
      • Segment Tree
    • Searching
      • Overview
      • Binary Search
      • Graph Search
      • Hash Table
      • String Search
    • Dynamic Programming
      • Overview
      • Fibonacci Numbers
      • LCS problem
    • Greedy Algorithms
      • Overview
Powered by GitBook
On this page

Was this helpful?

  1. Outline
  2. Randomization

Overview

PreviousRandomizationNextDiscrete Probability

Last updated 6 years ago

Was this helpful?

The history of mankind using the notion of random is widely reflected in gambling or insurance and in the fields of computer science as well through a number of analytic examples.

In the algorithm design, plays a pivot role in probabilistic algorithm designs in two ways of which we care about:

  • Classic algoritm is feeded with randomly generated inputs, in other words, the average inputs are studied to offer

  • inputs are provided as always to the algorithm in the classical way, but processed in a random manner. The internal execution model dealing with randomization is a typical .

Table of Contents

  • - probability analysis, indicator random variable and several statistics definitions covered.

  • - median-finding problem, ith order statistic finding problem are analyzed and solved randomly and deterministic.

  • - an introduction to a common technique in data processing.

average-case analysis
Worst-case
randomized algorithm
Discrete Probability
Randomized Algorithms
Reservoir Sampling
randomization