摘要
阐述了冒泡排序算法设计的基本思想、实现步骤,并通过Visual Basic编程予以实现,指出其效率不高的缺陷,提出了对冒泡排序改进的标志变量法及其编程实现,其效率及性能较冒泡排序算法有一定程度的提高.同时对冒泡排序及其改进算法进行了时间复杂度、空间复杂度和稳定性的分析和比较.
This article expatiates upon the essence, implement of bubble sort algorithm, which is programmed in Visual Basic language. It also points out this algorithm＇s inefficient disadvantage and brings forward the indraught of flag variable improved methods, together with its own program in VB, which results in the improvement of efficiency and performance to some certainty. It also analyzes this algorithm＇s complexity of time and space as well as its stability.
出处
《山东师范大学学报（自然科学版）》
CAS
2007年第2期34-36,共3页
Journal of Shandong Normal University(Natural Science)
关键词
冒泡排序法
标志变量法
算法分析
bubble sort algorithm
flag variable
algorithm analysis
