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

一种非比较分段排序算法的研究
引用本文:江华,谭新星.一种非比较分段排序算法的研究[J].计算机应用与软件,2003,20(4):46-48.
作者姓名:江华  谭新星
作者单位:韶关学院计算机系,韶关,512005
摘    要:非比较分段排序(简称NCSS)算法是建立在模仿人类思想方式基础上的一种非比较排序算法,算法分析和实验结果都表明:NCSS算法的时间复杂度和待排序数据分布无关,为O(N),而附加存储空间极小,排序速率明显优于QuickSort,ProportionSplitSort,分段快速排序等算法,NCSS算法特别适合于数据最大的场合。

关 键 词:非比较分段排序算法  数据结构  算法分析  快速排序  时间复杂度  计算机

A STUDY ON NON-COMPARATIVE SECTIONAL SORTING ALGORITHM
Jiang Hua Tan Xinxing.A STUDY ON NON-COMPARATIVE SECTIONAL SORTING ALGORITHM[J].Computer Applications and Software,2003,20(4):46-48.
Authors:Jiang Hua Tan Xinxing
Abstract:Non-comparative sectional sorting algorithm (NCSS) is based on imitating man's mode of thinking. The algorithm analysis and experimental results show that the time complexity of NCSS algorithm is O(N), which is not relate to the data distribution. The appended storage space is very small, and its sorting speed is obviously better than those of Quicksort,ProportionSplit Sort and Sectional Quicksort. NCSS algorithm particularly suits to the situation of large amounts of data.
Keywords:Data structure Analysis of algorithm Quick sort
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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