Advertisement

Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

A note on synthesis and classification of sorting algorithms

  • 77 Accesses

  • 3 Citations

Summary

Sorting algorithms are traditionally classified according to their main operational characteristic. More recently, program synthesis has been used as a basis for classification. We briefly survey previous work in the synthesis and classification of sorting algorithms, and outline a more comprehensive scheme derived by synthesising many sorting algorithms in a top-down fashion on a semi-automated logic programming system.

This is a preview of subscription content, log in to check access.

References

  1. 1.

    Barstow, D.R.: Remarks on “a synthesis of several sorting algorithms” by John Darlington. Acta Inf. 13, 225–227 (1980)

  2. 2.

    Bitton, D., De Witt, D.J., Hsiao, D.K., Menon, J.: A taxonomy of parallel sorting. Comput. Sur. 16, 289–318 (1984)

  3. 3.

    Burstall, R.M., Darlington, J.: A transformation system for developing recursive programs. J. ACM 24, 44–67 (1977)

  4. 4.

    Clark, K.L., Darlington, J.: Algorithm classification through synthesis. Comput. J. 23, 61–65 (1980)

  5. 5.

    Darlington, J.: A synthesis of several sorting algorithms. Acta Inf. 11, 1–30 (1978)

  6. 6.

    Dijkstra, E.W.: A discipline of programming. Englewood Cliffs, N.J.: Prentice-Hall 1976

  7. 7.

    Dromey, R.G.: Derivation of sorting algorithms from a specification. Comput. J. 30, 512–518 (1987)

  8. 8.

    Green, C., Barstow, D.: On program synthesis knowledge. Arti. Intell. 10, 241–279 (1978)

  9. 9.

    Hansson, A., Tärnlund, S.A.: Program transformation by data structure mapping. In: Clark, K.L., Tärnlund, S.A. (eds.) Logic Programming, pp. 117–122. London: Academic Press 1982

  10. 10.

    Hoare, C.A.R.: Quicksort. Comput. J. 5, 10–15 (1962)

  11. 11.

    Knuth, D.E.: The art of computer programming, Vol. 3: Sorting and searching. Reading: Addison-Wesley 1973

  12. 12.

    Lau, K.K., Prestwich, S.D.: Synthesis of logic programs for recursive sorting algorithms. Technical Report UMCS-88-10-1, Department of Computer Science, University of Manchester, October 1988

  13. 13.

    Manna, Z., Waldinger, R.: Synthesis: Dreams ⇒ programs. IEEE Trans. Soft. Eng. 5, 294–328 (1979)

  14. 14.

    Mehlhorn, K.: Data structures and algorithms 1: Sorting and searching. Berlin Heidelberg New York Tokyo: Springer 1984

  15. 15.

    Smith, D.R.: Top-down synthesis of divide-and-conquer algorithms. Arti. Intell. 27, 43–96 (1985)

  16. 16.

    Smith, D.R.: The design of divide and conquer algorithms. Sci. Comput. Program. 5, 37–58 (1985)

  17. 17.

    Wainwright, R.L.: A class of sorting algorithms based on quicksort. Comm. ACM 28, 396–402 (1985)

Download references

Author information

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Lau, K.K. A note on synthesis and classification of sorting algorithms. Acta Informatica 27, 73–80 (1989). https://doi.org/10.1007/BF00263502

Download citation

Keywords

  • Information System
  • Operating System
  • Data Structure
  • Communication Network
  • Operational Characteristic