Median of medians
In computer science, the median of medians is an approximate (median) selection algorithm, frequently used to supply a good pivot for an exact selection algorithm, mainly the quickselect, that selects the kth largest element of an initially unsorted array. Median of medians finds an approximate median in linear time only, which is limited but an additional overhead for quickselect. When this approximate median is used as an improved pivot, the worst-case complexity of quickselect reduces significantly from quadratic to linear, which is also the asymptotically optimal worst-case complexity of any selection algorithm. In other words, the median of medians is an approximate median-selection algorithm that helps building an asymptotically optimal, exact general selection algorithm (especially
Wikipage redirect
BFPRTCache-oblivious distribution sortExternal sortingFloyd–Rivest algorithmHybrid algorithmIntroselectIntrosortK-d treeManuel BlumMedianMedian of 5Median of Medians algorithmPartial sortingQuickselectQuicksortRange query (data structures)Robert TarjanScience and technology in VenezuelaSelection algorithmSorting algorithmVaughan Pratt
Link from a Wikipage to another Wikipage
primaryTopic
Median of medians
In computer science, the median of medians is an approximate (median) selection algorithm, frequently used to supply a good pivot for an exact selection algorithm, mainly the quickselect, that selects the kth largest element of an initially unsorted array. Median of medians finds an approximate median in linear time only, which is limited but an additional overhead for quickselect. When this approximate median is used as an improved pivot, the worst-case complexity of quickselect reduces significantly from quadratic to linear, which is also the asymptotically optimal worst-case complexity of any selection algorithm. In other words, the median of medians is an approximate median-selection algorithm that helps building an asymptotically optimal, exact general selection algorithm (especially
has abstract
Algorytm magicznych piątek (zn ...... m problem, algorytmie Hoare’a.
@pl
In computer science, the media ...... ring to quickselect as "FIND".
@en
In informatica, BFPRT (Blum, F ...... ccolo di un array disordinato.
@it
La médiane des médianes est un ...... Floyd, (en), Rivest et Tarjan.
@fr
中央値の中央値(ちゅうおうちのちゅうおうち、英: media ...... ムをPICKと呼び、クイックセレクトをFINDと呼んでいた。
@ja
Link from a Wikipage to an external page
Wikipage page ID
40,327,133
page length (characters) of wiki page
Wikipage revision ID
1,017,497,918
Link from a Wikipage to another Wikipage
class
name
Median of Medians
@en
optimal
Yes
@en
space
auxiliary
@en
wikiPageUsesTemplate
subject
comment
Algorytm magicznych piątek (zn ...... m problem, algorytmie Hoare’a.
@pl
In computer science, the media ...... lection algorithm (especially
@en
In informatica, BFPRT (Blum, F ...... ccolo di un array disordinato.
@it
La médiane des médianes est un ...... Floyd, (en), Rivest et Tarjan.
@fr
中央値の中央値(ちゅうおうちのちゅうおうち、英: media ...... ムをPICKと呼び、クイックセレクトをFINDと呼んでいた。
@ja
label
Algorytm magicznych piątek
@pl
BFPRT
@it
Median of medians
@en
Médiane des médianes
@fr
中央値の中央値
@ja