Multiway in-place merging (Q964398): Difference between revisions

From MaRDI portal

Jump to:navigation, search

← Older edit Newer edit →

Revision as of 16:23, 2 July 2024

scientific article

Language	Label	Description	Also known as
English	Multiway in-place merging	scientific article

Statements

scholarly article

0 references

Multiway in-place merging (English)

0 references

0 references

0 references

Theoretical Computer Science

0 references

publication date

15 April 2010

0 references

zbMATH Keywords

in-place algorithms

0 references

merging

0 references

sorting

0 references

describes a project that uses

0 references

MaRDI profile type

0 references

full work available at URL

https://doi.org/10.1016/j.tcs.2010.01.034

0 references

A Note on HEAPSORT

0 references

Optimizing stable in-place merging.

0 references

On a stable minimum storage merging algorithm

0 references

Sorting by Merging or Merging by Sorting?

0 references

An in-place sorting with <i>O</i> ( <i>n</i> log <i>n</i> ) comparisons and <i>O</i> ( <i>n</i> ) moves

0 references

Multiway In-Place Merging

0 references

Asymptotically efficient in-place merging

0 references

In-place sorting with fewer moves

0 references

0 references

The Analysis of Heapsort

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

0 references

10.1016/j.tcs.2010.01.034

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:964398

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q964398&oldid=35162906"