The design and analysis of a new hybrid sorting algorithm
type: Item
instance of: scholarly article
title: The design and analysis of a new hybrid sorting algorithm
zbMATH Open document ID: 0447.68067
DOI: 10.1016/0020-0190(80)90143-X
author: Selim G. Akl
author: Henk Meijer
published in: Information Processing Letters
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 62G30
zbMATH DE Number: 3700231
zbMATH Keywords: hybrid sorting algorithm
zbMATH Keywords: algorithm design and analysis
zbMATH Keywords: expected complexity
zbMATH Keywords: sorting by comparison
zbMATH Keywords: sorting by distribution
MaRDI profile type: Publication
cites work: Q4194455
cites work: Sorting by distributive partitioning
cites work: An efficient algorithm for determining the convex hull of a finite planar set
cites work: Q3259350
cites work: Q5585020
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: Location of a Point in a Planar Subdivision and Its Applications
cites work: Q5637872
cites work: Q3264494
cites work: New Parallel-Sorting Schemes
full work available at URL: 0020-0190(80)90143-x
OpenAlex ID: W2030641205
description: scientific article; zbMATH DE number 3700231