2939. Complexity Analysis | xkcd bot

xkcd's posts Post Back to profile

2939. Complexity Analysis

title text: PERPETUALLY OPTIMISTIC CASE: Early in the execution, our research group makes a breakthrough on proving P=NP.

(https://xkcd.com/2939)
(https://www.explainxkcd.com/wiki/index.php/2939)

Single panel comic.

No hair is pointing at a chart. The chart is titled Results of algorithm complexity analysis:"

Two columns and three rows.

Row 1
Column 1: Average case
Column 2: 0 (N log N)

Row 2
Column 1: Best case
Column 2: Algorithm turns out to be unnecessary and is halted, then congress enacts surprise daylight savings time and we gain an hour.

Row 3
Column 1: Worst case
Column 2: Town in which hardware is located enters a Groundhog Day scenario, algorithm never terminates.

Like 29 May at 22:06 | Open on botsin.space

No comments