Remarks on “A Synthesis of Several Sorting Algorithms” by John Darlington
- 54 Downloads
In his paper “A Synthesis of Several Sorting Algorithms,” John Darlington presents syntheses for six different sorting algorithms, together with a family tree of sorting algorithms, and mentions a symmetry between Quick Sort, Selection Sort, Merge Sort, and Insertion Sort. In our own attempts to codify programming knowledge, we have developed a slightly different family tree which shows similar symmetries, and which also shows that Bubble Sort and Sinking Sort can be viewed as in-place versions of Selection Sort and Insertion Sort, thus adding another symmetry to those noted by Darlington.
KeywordsInformation System Operating System Data Structure Communication Network Information Theory
Unable to display preview. Download preview PDF.
- 1.Barstow, D.R.: An experiment in knowledge-based automatic programming. Artificial Intelligence 12, 73–120 (1979)Google Scholar
- 2.Barstow, D.R.: Knowledge-based program construction. New York: Elsevier North Holland 1979Google Scholar
- 3.Darlington, J.: A synthesis of several sorting algorithms. Acta Informat. 11, 1–30 (1978)Google Scholar
- 4.Green, C.C., Gabriel, R.P., Kant, E, Kedzierski, B.I., McCune, B.P., Phillips, J.V., Tappel, S.T., Westfold, S.J.: Results in knowledge based program synthesis. Sixth International Joint Conference on Artificial Intelligence, 342–344 (1979)Google Scholar
- 5.Green, C.C., Barstow, D.R.: On program synthesis knowledge. Artificial Intelligence 10, 241–279 (1978)Google Scholar
- 6.Kant, E.: A knowledge-based approach to using efficiency estimation in program synthesis. Sixth International Joint Conference on Artificial Intelligence, 457–462 (1979)Google Scholar
- 7.Knuth, D.E.: The art of computer programming, vol. 3: Sorting and searching. Reading: Addison-Wesley 1973Google Scholar