摘要
本文作者对传统的冒泡排序算法进行了时间复杂性分析，指出其效率不高的缺陷，提出了双向同时浮沉的改进方法，并编程予以实现。其效率较传统的冒泡排序算法有一定程度的提高．
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.
出处
《黑龙江科技学院学报》
CAS
2002年第1期25-27,共3页
Journal of Heilongjiang Institute of Science and Technology
关键词
冒泡法排序
算法
时间复杂性
效率
编程
Bubble Sort
Algorithm
Time Complexity, Efficiency
Programming
