skip to main content
article
Free Access

Average case analysis when merging two ordered lists of different length

Published:01 September 1991Publication History
Skip Abstract Section

Abstract

A derivation for the expected number of comparisons when merging two ordered lists is given, where the sizes of the individual lists are unknown but the size of the merged list is known. Other applications where this result can be applied are also mentioned, most notably the LUPSort algorithm of Merritt and Nauck[4].

References

  1. [1] Dijkstra, E. W. Some beautiful arguments using mathematical induction. Acts Informatics, 13(1982), 1-15.Google ScholarGoogle Scholar
  2. [2] Golub, E. B., Augenstein, M. Creation of a new case for LUPSort: ALERNATING. 22nd SIGCSE Technical Symposium on Computer Science Education, SIGCSE Bulletin, 1991, vol. 23, number 1, 108-111. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. [3] Knuth, D. E. The Art of Computer Programming, volume 3: Sorting and Searching. Addison Wesley, 1973. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. [4] Merritt, S. M., Nauck, C. Y. Inventing a new sorting algorithm: a case study. 21st SIGCSE Technical Symposium on Computer Science Education, SIGCSE Bulletin vol. 22, number 1, 1990, 181-185. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. [5] Nagler, H. An estimation of the relative efficiency of two internal sorting methods. Communications of the ACM, vol. 3, number 11 (1960), 618-620. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. [6] Sedgewick R. Algorithms in C. Addison Wesley, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Average case analysis when merging two ordered lists of different length

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM SIGCSE Bulletin
        ACM SIGCSE Bulletin  Volume 23, Issue 3
        Sept. 1991
        65 pages
        ISSN:0097-8418
        DOI:10.1145/126459
        Issue’s Table of Contents

        Copyright © 1991 Author

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 September 1991

        Check for updates

        Qualifiers

        • article
      • Article Metrics

        • Downloads (Last 12 months)5
        • Downloads (Last 6 weeks)0

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!