摘要
排序是计算机科学的一个重要领域,在数据处理中占有极其重要的位置。在程序开发中实现大量排序应用时,所要求的就是简单、有效、快捷的算法。为提高其执行的效率,将在阐述传统冒泡排序的理解及执行过程中,对其算法深入分析,着重阐述冒泡排序算法的改进与提高过程,从基本方法入手,对其改进算法进行分析、实验,并总结得出最有效的改进算法。
Sort is an important area of computer science, and also occupies an extremely important position in data processing. In order to achieve a large number of applications in the program development, the requirement of algorithms is simple, effective and efficient. To improve the efficiency of its implementation, during the state of understanding and implementation process of traditional bubble sort, doing deep analysis of its algorithm, focusing on the improvement and enhancement process of bubble sort algorithm, starting from the basic method, and doing analysis and experiment of the improved algorithm, then concluding a most efficient improved algorithm.
出处
《电脑知识与技术（过刊）》
2010年第3X期1980-1982,1991,共4页
Computer Knowledge and Technology
关键词
算法
改进
冒泡排序
algorithm
improvement
bubble sort
