Figure 5
From: An efficient pseudomedian filter for tiling microrrays
Observed runtime differences between computing the pseudomedian from its definition and by following Monahan's algorithm. On the x-axis is the number of randomly generated numbers for which the pseudomedian was desired. The y-axis is the result of dividing the definition's runtime by Monahan's runtime on the same set of values. The ratio scales linearly with number of elements as predicted from theory. The definition requires a O(n2logn) computation whereas Monahan's algorithm needs just O(n logn) computing time; we therefore expect a linear increase in their runtime ratio as n increases, and this is what we observe.