ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Internal Sorting Using a Minimal Tree Merge Strategy
Full text PdfPdf (776 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 6 ,  Issue 1  (March 1980) table of contents
Pages: 68 - 79  
Year of Publication: 1980
ISSN:0098-3500
Author
Leigh R. Power  IBM Thomas J. Watson Research Center, Yorktown Heights, NY
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 25,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/355873.355879
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
C. Bron, Merge sort algorithm [M1], Communications of the ACM, v.15 n.5, p.357-358, May 1972  [doi>10.1145/355602.361317]
 
2
BURGE, W.H. Sorting, trees, and measures of order. Inform. Contr. 1 (Sept. 1958), 181-197.
 
3
MORRm, R. Some theorems on sorting. SIAM J. Appl. Math. 17 (Jan. 1969), 1-6.
 
4
WOODALL, A.D. Algorithm 45 an internal sorting procedure using a two-way merge. The Computer J. 13 (Feb. 1970), 110-111.
 
5
WOODRUM, L.J. Internal sorting with mmimal companng. IBM Syst. J. 8 (1969), 189-203.

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Sorting and searching

Additional Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Computations on discrete structures

  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.2 Graph Theory
          Subjects: Trees


General Terms:
Algorithms, Theory

Collaborative Colleagues:
Leigh R. Power: colleagues

Peer to Peer - Readers of this Article have also read:

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player