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
Algorithm 505: A List Insertion Sort for Keys with Arbitrary Key Distribution [S20]
Full text PdfPdf (214 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 2 ,  Issue 2  (June 1976) table of contents
Pages: 204 - 206  
Year of Publication: 1976
ISSN:0098-3500
Author
Wolfgang Janko  Institut fur Statistik und Mathematik, Hochschule fur Welthandel, Franz-Klein-Gasse 1, A-1190, Wien, Austria
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 24,   Citation Count: 0
Additional Information:

appendices and supplements   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/355681.355691
What is a DOI?

APPENDICES and SUPPLEMENTS
gZipSPN (505.gz) (2 KB)
insertion sort for linked lists, insensitive to the key distribution
Gams: N6a2a


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:
  E. Data

  G. Mathematics of Computing


General Terms:
Algorithms, Experimentation, Theory

Collaborative Colleagues:
Wolfgang Janko: 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