Research of Sorting Algorithms Teaching Based on Recursion-and-Division
ZHANG Zhongcheng
LU Faming
Abstract：There are various types of sorting algorithms,including insertion-based,swap-based,selection-based,and merge-based sorting algorithms. Different sorting algorithms have different sorting principles and processes. However,many of these algorithms can be derived from the classic problem solving strategy—recursion and divide-and-conquer. This paper studies the re?cursion and divide-and-conquer strategy behind those sorting algorithms. After that,from the perspective of recursion,the similari?ties and differences between those sorting algorithms in sorting principle,process and sorting performance are analyzed. As a result, one can deepen their understanding of sorting algorithms and recursive and divide-and-conquer strategies.
Keywords：sorting algorithmrecursion and divide-and-conqueralgorithm design and analysis
Publication Date：2019-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：6( 2109-2114 )