计算机程序设计中的排序方法  

Sorting methods in computer program design

作　　者：吴奇英[1] 

机构地区：[1]哈尔滨职业技术学院,黑龙江哈尔滨150000

出　　处：《交通科技与经济》2007年第4期74-76,共3页Technology & Economy in Areas of Communications

摘　　要：排序是计算机程序设计中的一种重要操作,它的功能是将一个数据元素(或记录)的任意序列重新排列成一个按关键字有序的序列。由于待排序的记录数量不同,使得排序过程中涉及的存储器不同,可将排序方法分为内部排序和外部排序两大类。主要研究内部排序中的冒泡法排序、选择法排序、快速排序3种排序方法。从排序的思想、排序的过程以及算法的稳定性3个方面进行探讨。Sorting is an important operation in computer programs design. Its function is re-sorting an arbitrary data element （or record） into a series by keywords. Because of the record number of different sorting question, it makes the process of sorting allocate different memories. Sorting can be divided into two types： one is the in- ternal sorting, it is a sorting process for the record to store in the computer＇s memory; The other is the external sorting, it refers to visit external memory in the process of sorting because the large number of sorting records, A memory which can not accommodate all the records. In the paper we discusses the order of several internal： bubble sorting, selection sorting, quick sorting and so on, This paper discusses mainly the thinking of sorting, the sorting process and the stability of the three algorithms.

关 键 词：排序 冒泡法排序 选择法排序 快速排序 

分 类 号：TP311.1[自动化与计算机技术—计算机软件与理论]