冒泡排序算法的改进  

The Improvement of Bubble Sort Algorithm

作　　者：许善祥[1] 高军[1] 纪玉玲[1] 

机构地区：[1]黑龙江八一农垦大学计算机科学系,黑龙江密山158308

出　　处：《黑龙江科技学院学报》2002年第1期25-27,共3页Journal of Heilongjiang Institute of Science and Technology

摘　　要：本文作者对传统的冒泡排序算法进行了时间复杂性分析，指出其效率不高的缺陷，提出了双向同时浮沉的改进方法，并编程予以实现。其效率较传统的冒泡排序算法有一定程度的提高．In this paper, the author points out the bug, the lower efficiency of traditional bubble sort algorithm after having made analyze in its time complexity, and then puts forward a method by means of simultaneous floating and sinking data from the two ends of array, and programs to implement it which improves in effciency to a certain extent over the traditional bubble sort algorithm.

关 键 词：冒泡法排序 算法 时间复杂性 效率 编程 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]