首页 | 本学科首页   官方微博 | 高级检索  
     

计算机程序设计中的排序方法
引用本文:吴奇英. 计算机程序设计中的排序方法[J]. 交通科技与经济, 2007, 9(4): 74-76
作者姓名:吴奇英
作者单位:哈尔滨职业技术学院,黑龙江,哈尔滨,150000
摘    要:排序是计算机程序设计中的一种重要操作,它的功能是将一个数据元素(或记录)的任意序列重新排列成一个按关键字有序的序列。由于待排序的记录数量不同,使得排序过程中涉及的存储器不同,可将排序方法分为内部排序和外部排序两大类。主要研究内部排序中的冒泡法排序、选择法排序、快速排序3种排序方法。从排序的思想、排序的过程以及算法的稳定性3个方面进行探讨。

关 键 词:排序  冒泡法排序  选择法排序  快速排序
文章编号:1008-5696(2007)04-0074-03
修稿时间:2007-03-04

Sorting methods in computer program design
WU Qi-ying. Sorting methods in computer program design[J]. Technology & Economy in Areas of Communications, 2007, 9(4): 74-76
Authors:WU Qi-ying
Affiliation:Harbin Institute of Vocational Technology, 150000 Harbin, China
Abstract:Sorting is an important operation in computer programs design. Its function is re-sorting an arbitrary data element (or record) into a series by 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 internal 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.
Keywords:sorting  bubble sorting  selection sorting  quick sort
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号