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

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

instance of

scholarly article

0 references

title

QuickHeapsort: modifications and improved analysis (English)

0 references

QuickHeapsort: Modifications and Improved Analysis (English)

0 references

0 references

0 references

Theory of Computing Systems

0 references

Computer Science – Theory and Applications

0 references

publication date

18 January 2017

0 references

14 June 2013

0 references

full work available at URL

https://arxiv.org/abs/1209.4214

0 references

zbMATH Keywords

in-place sorting

0 references

Heapsort

0 references

Quicksort

0 references

analysis of algorithms

0 references

heapsort

0 references

quicksort

0 references

MaRDI profile type

MaRDI publication profile

0 references

describes a project that uses

QuickHeapsort

0 references

cites work

Time bounds for selection

0 references

QuickHeapsort, an efficient mix of classical sorting algorithms

0 references

Q4525712

0 references

In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses

0 references

Q3651735

0 references

Weak-heap sort

0 references

Implementing HEAPSORT with ( n log n - 0.9 n ) and QUICKSORT with ( n log n + 0.2 n ) comparisons

0 references

Heaps on Heaps

0 references

Q4953348

0 references

Q4344097

0 references

Optimal Sampling Strategies in Quicksort and Quickselect

0 references

Building heaps fast

0 references

Q4035664

0 references

BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small)

0 references

Identifiers

zbMATH Open document ID

1353.68063

0 references

1345.68120

0 references

DOI

10.1007/s00224-015-9656-y

0 references

10.1007/978-3-642-38536-0_3

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:504991

@@ Property / cites work @@
+Time bounds for selection
@@ Property / cites work: Time bounds for selection / rank @@
+Normal rank
@@ Property / cites work @@
+QuickHeapsort, an efficient mix of classical sorting algorithms
+Normal rank
@@ Property / cites work @@
+Q4525712
@@ Property / cites work: Q4525712 / rank @@
+Normal rank
@@ Property / cites work @@
+In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Weak-heap sort
@@ Property / cites work: Weak-heap sort / rank @@
+Normal rank
@@ 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
+Normal rank
@@ Property / cites work @@
+Heaps on Heaps
@@ Property / cites work: Heaps on Heaps / rank @@
+Normal rank
@@ Property / cites work @@
+Q4953348
@@ Property / cites work: Q4953348 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4344097
@@ Property / cites work: Q4344097 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Sampling Strategies in Quicksort and Quickselect
+Normal rank
@@ Property / cites work @@
+Building heaps fast
@@ Property / cites work: Building heaps fast / rank @@
+Normal rank
@@ Property / cites work @@
+Q4035664
@@ Property / cites work: Q4035664 / rank @@
+Normal rank
@@ Property / cites work @@
+BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small)
+Normal rank