摘要
该文提出了基于冒泡排序算法的改进,通过在每趟循环中确定不止一个元素经排序后的位置,减少排序过程中循环所需的趟数,提高将数据元素从无序序列到有序序列的实现速度。
This article makes an improvement based on bubble sort which is from “An Improved Assumption Based on Straight Selection Sorting”.It demonstrates that the assumption can speed up the ordering of data from disorder to order through locating the position of more than one elements after ordering in each circulation and reducing the circulations needed in ordering,
出处
《梧州学院学报》
2009年第3期61-65,共5页
Journal of Wuzhou University
基金
梧州学院科研项目(2007B007)
关键词
算法
冒泡排序
改进
arithmetic
Bubble Sort
improvement
