| 几种敌进的起泡排序算法的实现 |
| |
| 引用本文： | 朱蓉.几种敌进的起泡排序算法的实现[J].嘉兴学院学报,2004,16(3):22-24. |
| |
| 作者姓名： | 朱蓉 |
| |
| 作者单位： | 嘉兴学院信息工程学院,浙江嘉兴,314001 |
| |
| 摘 要： | 传统起泡排序是一种简单实用的信息处理方法，但它对事先已基本有序的文件进行操作时却不是高效的。该文利用原有排序提供的交换技术，结合不同的前提条件，设计了四种改进方法，并分别用算法加以实现。
|
| 关 键 词： | 起泡排序 交换 改进 算法 |
| 文章编号： | 1008-6781(2004)03-0022-03 |
| 修稿时间： | 2003年8月19日 |
Realization of Some Improved Algorithms in Bubble Sort |
| |
| ZHU Rong.Realization of Some Improved Algorithms in Bubble Sort[J].Journal of Jiaxing College,2004,16(3):22-24. |
| |
| Authors: | ZHU Rong |
| |
| Abstract: | The traditional bubble sort is a simple and applicable information processing method, but is not effective in operating the file, in which some records have been sorted beforehand. In this paper, with the exchanging techniques, provided by the original sort, combined with different premise conditions, four improved means are designed, which can be realized respectively with algorithm. |
| |
| Keywords: | bubble sort exchange improve algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
