QuickHeapsort: modifications and improved analysis (Q504991): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
aliases / en / 0aliases / en / 0
 
QuickHeapsort: Modifications and Improved Analysis
description / endescription / en
scientific article
scientific article; zbMATH DE number 6176239
Property / title
 
QuickHeapsort: Modifications and Improved Analysis (English)
Property / title: QuickHeapsort: Modifications and Improved Analysis (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1345.68120 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-642-38536-0_3 / rank
 
Normal rank
Property / published in
 
Property / published in: Computer Science – Theory and Applications / rank
 
Normal rank
Property / publication date
 
14 June 2013
Timestamp+2013-06-14T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 14 June 2013 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6176239 / rank
 
Normal rank
Property / zbMATH Keywords
 
heapsort
Property / zbMATH Keywords: heapsort / rank
 
Normal rank
Property / zbMATH Keywords
 
quicksort
Property / zbMATH Keywords: quicksort / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1925220756 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3102487001 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1209.4214 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: QuickHeapsort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounds for selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: QuickHeapsort, an efficient mix of classical sorting algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak-heap sort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing <i>HEAPSORT</i> with ( <i>n</i> log <i>n</i> - 0.9 <i>n</i> ) and <i>QUICKSORT</i> with ( <i>n</i> log <i>n</i> + 0.2 <i>n</i> ) comparisons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heaps on Heaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sampling Strategies in Quicksort and Quickselect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Building heaps fast / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:16, 13 July 2024

scientific article; zbMATH DE number 6176239
  • QuickHeapsort: Modifications and Improved Analysis
Language Label Description Also known as
English
QuickHeapsort: modifications and improved analysis
scientific article; zbMATH DE number 6176239
  • QuickHeapsort: Modifications and Improved Analysis

Statements

QuickHeapsort: modifications and improved analysis (English)
0 references
QuickHeapsort: Modifications and Improved Analysis (English)
0 references
0 references
0 references
0 references
0 references
18 January 2017
0 references
14 June 2013
0 references
0 references
0 references
in-place sorting
0 references
Heapsort
0 references
Quicksort
0 references
analysis of algorithms
0 references
heapsort
0 references
quicksort
0 references
0 references
0 references
0 references