Funnelsort
Funnelsort is a comparison-based sorting algorithm. It is similar to mergesort, but it is a cache-oblivious algorithm, designed for a setting where the number of elements to sort is too large to fit in a cache where operations are done. It was introduced by Matteo Frigo, Charles Leiserson, Harald Prokop, and Sridhar Ramachandran in 1999 in the context of the cache oblivious model.
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
Funnelsort
Funnelsort is a comparison-based sorting algorithm. It is similar to mergesort, but it is a cache-oblivious algorithm, designed for a setting where the number of elements to sort is too large to fit in a cache where operations are done. It was introduced by Matteo Frigo, Charles Leiserson, Harald Prokop, and Sridhar Ramachandran in 1999 in the context of the cache oblivious model.
has abstract
Funnelsort is a comparison-bas ...... of the cache oblivious model.
@en
Wikipage page ID
42,794,816
page length (characters) of wiki page
Wikipage revision ID
993,026,331
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
comment
Funnelsort is a comparison-bas ...... of the cache oblivious model.
@en
label
Funnelsort
@en