几种改进的起泡排序算法的实现

Realization of Some Improved Algorithms in Bubble Sort

传统起泡排序是一种简单实用的信息处理方法 ,但它对事先已基本有序的文件进行操作时却不是高效的。该文利用原有排序提供的交换技术 ,结合不同的前提条件 ,设计了四种改进方法 。

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.