改进冒泡排序算法的设计及分析  

The Design and Analysis of the Improved Bubble-Sorting Algorithm

作　　者：孙义欣[1] 

机构地区：[1]潍坊教育学院信息工程系,山东青州262500

出　　处：《潍坊教育学院学报》2010年第1期55-57,共3页Journal of Weifang Educational College

摘　　要：冒泡排序方法是籍助"交换"进行排序的一种最基本的方法,但效率低。本研究在冒泡法排序过程中根据上一趟排序的情况对下一趟排序时的开始比较位置和终止比较位置进行重新规定,可以有效地减少排序过程中的比较次数,从而提高效率。Sorting is very important for computer data processing. A good sorting can not only improve the efficiency of searching information but also can directly influence the computers＇ working efficiency. Bubble sorting is one of the basic methods used to sort through exchange, but it is of low efticiency. While sorting, we can regulate again the starting comparison position and the ending comparison position of the second sorting based on the first sorting so that the comparison times can be effectively reduced in the sorting process, thus improving the efficiency.

关 键 词：冒泡法排序 标志 交换位置 

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