A dispersion pass algorithm for the polyphase merge

Authors:
Armando G. Mendoza
Affiliations:
Univac Division, Sperry-Rand Corp., Bluebell, PA
Venue:
Communications of the ACM
Year:
1962

Citing 2
Cited 6

Analysis of Internal Computer Sorting

Journal of the ACM (JACM)
A generalized polyphase merge algorithm

Communications of the ACM

Sorting

ACM Computing Surveys (CSUR)
Optimizing the polyphase sort

Communications of the ACM
String distribution for the polyphase sort

Communications of the ACM
A comparison between the polyphase and oscillating sort techniques

Communications of the ACM
A guided bibliography to sorting

IBM Systems Journal
Merge-sort analysis by matrix techniques

IBM Systems Journal

Quantified Score

Hi-index	48.26

Visualization

Abstract

This paper presents a new manner of dispersing strings for a Polyphase merge. If the number of strings dispersed is between two levels acceptable by Polyphase merge, a more economical technique of reaching the next level for Polyphase merge is shown and proved.