Consider the following extremely inefficient algorithm for...

Consider the following extremely inefficient algorithm for sorting $n$ numbers in increasing order. Start by choosing one of the $n$ numbers uniformly at random, and placing it first. Then choose one of the remaining $n-1$ numbers uniformly at random, and place it second. If the second number is smaller than the first, start over again from the beginning. Otherwise, next choose one of the remaining $n-2$ numbers uniformly at random, place it third, and so on. The algorithm starts over from the beginning whenever it finds that the $k$ th item placed is smaller than the $(k-1)$ th item. Determine the expected number of times the algorithm tries to place a number, assuming that the input consists of $n$ distinct numbers.

Key Concepts

Randomized Algorithms

These are algorithms that make random choices during their execution to influence their behavior or performance. The algorithm in question uses randomness to select items at each step, and its analysis involves understanding the probability of successful versus unsuccessful choices, which is central to the design and analysis of randomized algorithms.

Geometric Distribution

This concept comes into play when an algorithm repeats an independent random trial until a success is achieved, with each try having a constant probability of success. In the context of the inefficient sorting algorithm described, each attempt to place the next number correctly can be modeled using a geometric distribution, since the algorithm repeats (restarts) upon a failure, and the expected number of trials is inversely proportional to the success probability.

Recurrence Relations

Recurrence relations are equations that define sequences recursively: each term is expressed in terms of previous terms. When analyzing the expected cost of algorithms that restart or break into subproblems, a recurrence relation can be set up to express the expected number of operations (or placements) in terms of the number needed for smaller subinstances, as seen in the step?by?step analysis of the algorithm in question.

Factorial Growth

Factorial growth describes how functions grow very quickly – specifically, the n! (n factorial) rate. In many probabilistic analyses of permutations, including sorting algorithms that involve random orderings, factorial growth appears naturally. In this problem the likelihood of a complete sequence being sorted is 1/n!, and the expected number of placements ends up involving terms like n! multiplied by sums of reciprocals of lower factorials.

Probabilistic Analysis

Probabilistic analysis involves quantifying how randomness affects the performance of an algorithm. In this example, computing the expected number of number placements – by considering the probabilities of success and failure at each step and how often the algorithm must restart – is a classic application of probabilistic analysis, where tools such as expected values, geometric distributions, and recurrences are combined to evaluate the algorithm’s behavior.

Transcript

Please give Ace some feedback