摘要
本文对三种简单排序方法———冒泡排序、选择排序、插入排序分别进行了改进 ,进行了相应的算法复杂度分析 ,并编出程序上机实验 。
In this article, three simple sorts (bubble sort. selection sort, insertion sort) are improved and these algorithm complexities are analyzed. These algorithm routines are written out and the time that these routines last is compared.
出处
《北京建筑工程学院学报》
2001年第3期42-45,共4页
Journal of Beijing Institute of Civil Engineering and Architecture
关键词
冒泡排序
排序
插入排序
NS图
bubble sort
selection sort
insertion sort
NS-chart
