Cache-oblivious distribution sort
id:
cache-oblivious-distribution-sort-281-10897712
title:
Cache-oblivious distribution sort
text:
The cache-oblivious distribution sort is a comparison-based sorting algorithm. It is similar to quicksort, 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. In the external memory model, the number of memory transfers it needs to perform a sort of N items on a machine with cache of size Z and cache lines of length L is O , under the tall cache assumption that Z = Ω . This number of memory t
brand slug:
wiki
category slug:
encyclopedia
description:
Comparison-based sorting algorithm
original url:
https://en.wikipedia.org/wiki/Cache-oblivious_distribution_sort
date created:
date modified:
2023-11-01T18:35:03Z
main entity:
{"identifier":"Q17082367","url":"https://www.wikidata.org/entity/Q17082367"}
image:
fields total:
13
integrity:
14