Advertisement

Analysis of Shellsort and related algorithms

  • Robert Sedgewick
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1136)

Abstract

This is an abstract of a survey talk on the theoretical and empirical studies that have been done over the past four decades on the Shellsort algorithm and its variants. The discussion includes: upper bounds, including linkages to number-theoretic properties of the algorithm; lower bounds on Shellsort and Shellsort-based networks; average-case results; proposed probabilistic sorting networks based on the algorithm; and a list of open problems.

Keywords

Information Processing Letter Sorting Network Sorting Problem Linear Diophantine Equation Bubble Sort 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. Ajtai, J. Komlós, and E. Szemérdi.“An O(n log n) sorting network”, in Troc. I5th Ann. ACM Symp. on Theory of Computing, 1983.Google Scholar
  2. 2.
    M. Ajtai, J. Komlós, and E. Szemérdi. “Sorting in clog n parallel steps”, Combinatorica 3, 1983, 1–19.Google Scholar
  3. 3.
    K. Batcher. Sorting networks and their applications in Proceedings of the AFIPS Spring Joint Computer Conference 32, 1968, 307–314.Google Scholar
  4. 4.
    A. Brauer. “On a problem of partitiions”, Amer. J. Math. 64, 1942, 299–312.Google Scholar
  5. 5.
    W. Curran-Sharp. “Solution to Problem 7382 (Mathematics)”, Ed. times (London) 1, 1884.Google Scholar
  6. 6.
    B. Chazelle. Private communication, 1983.Google Scholar
  7. 7.
    R. Cypher.“A lower bound on the size of Shellsort sorting networks”, SIAM J. Computing 22, 1993, 62–71.Google Scholar
  8. 8.
    W. Dobosiewicz.“An efficient variation of bubble sort”. Information Processing Letters 11, 1980, 5–6.Google Scholar
  9. 9.
    G. Gonnet and R. Baeza-Yates. Handbook of Algorithms and Data Structures, 2nd edition, Addison-Wesley, Reading, MA, 1991.Google Scholar
  10. 10.
    H. Greenberg. “An algorithm for a linear diophantine equation and a problem of Frobenius”, Numer. Math. 34, 1980, 349–352.Google Scholar
  11. 11.
    T. Hibbard. “An empirical study of minimal storage sorting”, Communications of the ACM 6, 1963, 206–213.Google Scholar
  12. 12.
    G. Hofmeister. “Zu einem Problem von Frobenius”, Norske Vid. Selsk. Skr. 5, 1966, 1–37.Google Scholar
  13. 13.
    J. Incerpi. A Study of the Worst Case of Shellsort, Ph.D. thesis, Brown University, Department of Computer Science, 1985.Google Scholar
  14. 14.
    J. Incerpi and R. Sedgewick. “Improved Upper Bounds on Shellsort”, J. of Computer and System Sciences 31, 1985, 210–224.Google Scholar
  15. 15.
    J. Incerpi and R. Sedgewick. “Practical variations of Shellsort”, Information Processing Letters 26, 1987, 37–43.Google Scholar
  16. 16.
    S. Johnson. “A linear diophantine problem”, Canad. J. Math. 12, 1960, 390–398.Google Scholar
  17. 17.
    D. Knuth. The Art of Computer Programming. Volume 3: Sorting and Searching, Addison-Wesley, Reading, MA, 1973.Google Scholar
  18. 18.
    D. Knuth. Private communication, 1995.Google Scholar
  19. 19.
    R. Lazarus and R. Frank. “A high-speed sorting procedure”, Communications of the ACM 3, 1960, 20–22.Google Scholar
  20. 20.
    T. Leighton. “Tight bounds on the complexity of parallel sorting”, in Proc. 16th Ann. ACM Symp. on Theory of Computing, 1984.Google Scholar
  21. 21.
    T. Leighton. Introduction to parallel algorithms and architectures, Morgan Kaufmann, San Mateo, CA, 1992, 672.Google Scholar
  22. 22.
    T. Leighton and G. Plaxton. “A (fairly) simple circuit that (usually) sorts”, in Proc. 31st IEEE Symposium on Foundations of Computer Science, 1990, 264–274.Google Scholar
  23. 23.
    P. Lemke. “The performance of randomized Shellsort-like network sorting algorithms”, SCAMP working paper no. P18/94, Institute for Defense Analyses, Princeton, NJ, 1994.Google Scholar
  24. 24.
    M. Lewin. “On a linear diophantine problem”, Bull. London Math. Soc. 5, 1973, 75–78.Google Scholar
  25. 25.
    A. Papernov and G. Stasevich. “A method of information sorting in computer memories”, Problems of Information Transmission 1, 1965, 63–75.Google Scholar
  26. 26.
    C. Plaxton and T. Suel. “Improved lower bounds for Shellsort”, J. of Algorithms, to appear. Preliminary version in Proc. 33nd IEEE Symposium on Foundations of Computer Science, 1992, 226–235.Google Scholar
  27. 27.
    B. Poonen. “The worst case in Shellsort and related algorithms”, J. of Algorithms 15, 1993, 101–124.Google Scholar
  28. 28.
    V. Pratt. Shellsort and Sorting Networks, Garland, New York, 1979; Ph.D. thesis, Stanford University, 1971.Google Scholar
  29. 29.
    D. Robbins. “Experiments with shaker sort on the CRAY-2”, SCAMP working paper no. 22/89, Institute for Defense Analyses, Princeton, NJ, 1989.Google Scholar
  30. 30.
    R. Sedgewick. Algorithms, 2nd edition, Addison-Wesley, Reading, Mass, 1988.Google Scholar
  31. 31.
    R. Sedgewick. “A new upper bound for Shellsort”, J. Algorithms 7, 1986, 159–173.Google Scholar
  32. 32.
    R. Sedgewick. “Bricksort networks”, in preparation.Google Scholar
  33. 33.
    R. Sedgewick and P, Flajolet. An Introduction to the Analysis of Algorithms, Addison-Wesley, Reading, Mass., 1996.Google Scholar
  34. 34.
    E. Selmer. “On the linear diophantine problem of Frobenius”, J. Reine Angew. Math. 294, 1977, 1–17.Google Scholar
  35. 35.
    E. Selmer. “On Shellsort and the Frobenius problem”, TR 87-27, Department of Mathematics, University of Bergen, Norway, 1987.Google Scholar
  36. 36.
    D. Shell. “A high-speed sorting procedure”, Communications of the ACM 2, 1959, 30–32.Google Scholar
  37. 37.
    J. Vitter and P. Flajolet, “Analysis of algorithms and data structures”, in Handbook of Theoretical Computer Science A: Algorithms and Complexity, J. van Leeuwen, ed., Elsevier, Amsterdam, 1990, 431–524.Google Scholar
  38. 38.
    M. Weiss. Lower Bounds for Shellsort, Ph.D. thesis, Princeton University, Department of Computer Science, June 1987.Google Scholar
  39. 39.
    M. Weiss. “Empirical study of the expected running time of Shellsort”, Computer Journal 34, 1991, 88–91.Google Scholar
  40. 40.
    M. Weiss and R. Sedgewick. “Bad cases for shakersort”, Information Processing Letters 28, 1988, 133–136.Google Scholar
  41. 41.
    M. Weiss and R. Sedgewick. “Tight lower bounds for Shellsort”, J. of Algorithms 11, 1990, 242–251.Google Scholar
  42. 42.
    M. Weiss and R. Sedgewick. “More on Shellsort increment sequences”, Information Processing Letters 34, 1990, 267–270.MathSciNetGoogle Scholar
  43. 43.
    A. Yao. “An analysis of (h, k, 1) Shellsort”, Journal of Algorithms 1, 1980, 14–50.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Robert Sedgewick
    • 1
  1. 1.Princeton UniversityUSA

Personalised recommendations