| 拆分冒泡排序的算法与实现 |
| |
| 引用本文： | 王瑜.拆分冒泡排序的算法与实现[J].通化师范学院学报,2011(2):43-44,47. |
| |
| 作者姓名： | 王瑜 |
| |
| 作者单位： | 安徽广播电视大学; |
| |
| 摘 要： | 介绍了快速排序和冒泡排序的基本思想和算法时间复杂度,将两种算法结合提出了拆分冒泡排序算法,并用C语言实现算法,最后分析此算法的时间复杂度.
|
| 关 键 词： | 快速排序 冒泡排序 拆分冒泡排序 时间复杂度 |
Algorithm and Realization of Split Bubbling Sort |
| |
| WANG Yu.Algorithm and Realization of Split Bubbling Sort[J].Journal of Tonghua Teachers College,2011(2):43-44,47. |
| |
| Authors: | WANG Yu |
| |
| Institution: | WANG Yu(Anhui Radio& TV University,Hefei,Anhui 230022,China) |
| |
| Abstract: | The paper introduces the basic thought and time complexity of Fast Sort and Bubbling Sort,combines two algorithms and proposes Split Bubbling Sort,realizes the algorithm with C language,finally,analyzes Split Bubbling Sort's time complexity. |
| |
| Keywords: | Fast Sort Bubbling Sort Split Bubbling Sort time complexity |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
