Efficient unbalanced merge-sort

DOI10.1016/J.INS.2005.04.008zbMATH Open1156.68369OpenAlexW2074317266MaRDI QIDQ2489231FDOQ2489231

Authors: Enrico Nardelli, Guido Proietti 

Publication date: 16 May 2006

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2005.04.008

Recommendations

• An efficient multiway merging algorithm
• Asymptotically efficient in-place merging
• scientific article; zbMATH DE number 4001497
• Asymptotically efficient in-place merging
• scientific article; zbMATH DE number 4114045

zbMATH Keywords

data structuressortingexperimental analysisdesign of algorithms

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10)

Cites Work

• Title not available (Why is that?)
• A Fast Merging Algorithm
• Deterministic sorting in O ( n log log n ) time and linear space
• A data structure for manipulating priority queues
• Parallel database sorting
• Intersection reporting on two collections of disjoint sets

Cited In (5)

• On embedding subclasses of height-balanced trees in hypercubes
• On the complexity of min-max sorting networks
• Recursive merge sort with erroneous comparisons
• Significant improvements to the Ford-Johnson algorithm for sorting
• Sorting an array using the topological sort of a corresponding comparison graph

This page was built for publication: Efficient unbalanced merge-sort

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489231)