在教学中对冒泡排序算法的改进  

Teaching Exploring on Improvement of Bubble Sort Algorithm

作　　者：施祖平[1] 

机构地区：[1]南通纺织职业技术学院,江苏南通226007

出　　处：《通化师范学院学报》2010年第12期95-96,共2页Journal of Tonghua Normal University

摘　　要：冒泡法的基本思想是通过比较在待排数组中相邻元素的值来进行,在每一趟比较过程中使较大的元素向下"沉"而较小的元素向上"浮",从而完成排序的目的.为提高排序效率,可以分别从两头交替扫描进行冒泡排序,即采用"两头冒泡法"对其改进.The basic idea of bubble sort algorithm is through the comparison with the value of adjacent elements of unsorted array,and during every trip of the sorting the bigger value of element is＂sink＂and the smaller value of element is＂floating＂,through this kind of method achieving the purpose of element sort.To improve the efficiency of sorting,during bubble sort every trip can scan alternately from the two side of the array,that is＂bubble sort in two directions＂for improve original algorithm.

关 键 词：教学中冒泡排序法 两头冒泡法 改进 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]