Bottom-up-heap sort, a new variant of heap sort beating on average quick sort (if n is not very small)
Year: 2005
Type: conference-paper
Source: Springer eBooks
DOI: 10.1007/bfb0029650
Author: Ingo Wegener
Institution: TU Dortmund University
Language: English
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Open Access status: closed
OpenAlex ID: W4239246783
