Susan M. Merritt
ABSTRACT
A top-down approach is presented for the derivation of, and corresponding exposition of sorting algorithms. Work done in automatic program synthesis has produced interesting results about sorting algorithms which suggest this approach. In particular insertion sort and selection sort are seen to be instances of merge sort and Quick sort, and sinking sort and bubble sort are presented as in-place versions of insertion sort and selection sort. This top-down approach is offered as an alternative way of deriving and ultimately teaching about sorting algorithms.
- 1.Barstow, David R. "Remarks on 'A Synthesis of Several Sorting Algorithms' by John Darlington," Acta Informatica 13, 1980.Google Scholar
- 2.Darlington, John. "A Synthesis of Several Sorting Algorithms," Acta Informatica, 11, 1978.Google Scholar
- 3.Green, Cordell and Barstow, David. "On Program Synthesis Knowledge," Artificial Intelligence 10, 1978.Google Scholar
- 4.Horowitz, Ellis and Sahni, Sartaj. Fundamentals of Computer Algorithms, Computer Science Press, 1978.Google ScholarDigital Library
- 5.Knuth, Donald E. The Art of Computer Programming, vol.III: Sorting and Searching, Addison-Wesley, 1973. Google ScholarDigital Library
- 6.Wirth, Niklaus. Algorithms + Data Structures &equil; Programs, Prentice-Hall, 1976. Google ScholarDigital Library
Index Terms
- A top down approach to sorting
Recommendations
Comparing Four Important Sorting Algorithms Based on Their Time Complexity
ACAI '19: Proceedings of the 2019 2nd International Conference on Algorithms, Computing and Artificial IntelligenceTime complexity and memory complexity are significant for all algorithms, especially sorting algorithms. Using the right sorting algorithm for our data can possibly decrease time and memory usage. The sorting problem has attracted a great deal of ...
RVA Sorting Based On Bubble & Quick Sort Technique
ICTCS '14: Proceedings of the 2014 International Conference on Information and Communication Technology for Competitive StrategiesIn the new era of computer science, sorting algorithm is an efficient algorithm which performs an important task that place elements of a list in some order or arrange a set of items into a specific order. Sorting data has been developed to arrange the ...
Best sorting algorithm for nearly sorted lists
Straight Insertion Sort, Shellsort, Straight Merge Sort, Quickersort, and Heapsort are compared on nearly sorted lists. The ratio of the minimum number of list elements which must be removed so that the remaining portion of the list is in order to the size ...
Comments