摘要
在C语言程序设计中,排序算法是使用频率最高的算法之一,而冒泡排序是其中一种典型且相对简单的方法,学习它是为后面的选择排序作铺垫。文章在最初的冒泡排序算法上改进了两次,使算法达到一个更好的效果。通过冒泡排序及其改进算法的学习,可以提高学生的程序设计能力,为今后在算法与程序设计方面的进一步研究和学习打下基础。
In C language programming, sorting algorithm is one of the most frequently used algorithms, and bubble sorting is one of the typical and relatively simple methods. Learning it is to pave the way for subsequent sorting. This paper improved on the initial bubble sorting algorithm twice, making the algorithm a better result. Through the learning of bubble sorting and its improved algorithm, students' programming ability can be improved, which lays a foundation for further research and study in algorithm and program design.
引文
[1]李坤,邓波.冒泡排序算法的分析与改进[J].科技信息,2010(22):216.
[2]程妮.C语言中冒泡排序算法的教学设计与分析[J].现代计算机(专业版),2016(10):59-63.
[3]刘培元.C语言中冒泡排序算法的分层次学习[J].电脑知识与技术,2013(35):7987-7989.
[4]刘卉媚.Flash动画制作技巧[J].才智,2012(23):199.
[5]苏也惠.FLASH动画在新媒体中的应用研究[J].艺术科技,2015(9):295.
[6]RAMIN E,ARMIN E,TAYEBEH M.A sort implementation comparing with bubble sort and selection sort[C].Shanghai:2011 3rd International Conference on Computer Research and Development,2011:380-381.
[7]HADI S.Multimedia based instructional development:Bubble sort visualization[C].Beijing:2015 6th IEEE International Conference on Software Engineering and Service Science(ICSESS),2015:791-794.
[8]YUNXIA R,SHIYING W.Diagnosability of bubble-sort graph networks under the comparison diagnosis model[C].Jabalpur:2015International Conference on Computational Intelligence and Communication Networks(CICN),2015:823-826.