计算机与数字工程Issue(9)：2109-2114,6.DOI:10.3969/j.issn.1672-9722.2019.09.001
基于递归与分治的排序算法教学探究∗
Research of Sorting Algorithms Teaching Based on Recursion-and-Division
摘要
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.关键词
排序算法/递归与分治/算法设计与分析Key words
sorting algorithm/recursion and divide-and-conquer/algorithm design and analysis分类
信息技术与安全科学引用本文复制引用
张忠诚,鲁法明..基于递归与分治的排序算法教学探究∗[J].计算机与数字工程,2019,(9):2109-2114,6.基金项目
国家自然科学基金项目(编号:61602279) （编号:61602279）
山东省博士后创新专项资金项目(编号:201603056) （编号:201603056）
国家海洋局海洋遥测工程技术研究中心开放基金项目(编号:2018002) （编号:2018002）
山东科技大学计算机学院杰出青年基金项目资助. （）
