A New Sorting Method by Linking

YANG Dashun, TAO Minghua, DING Qing, GU Yunying. A New Sorting Method by LinkingJ. Journal of Computer Research and Development, 1993, 30(8): 1-5.

Citation:

YANG Dashun, TAO Minghua, DING Qing, GU Yunying. A New Sorting Method by LinkingJ. Journal of Computer Research and Development, 1993, 30(8): 1-5.

Citation:

YANG Dashun, TAO Minghua, DING Qing, GU Yunying. A New Sorting Method by LinkingJ. Journal of Computer Research and Development, 1993, 30(8): 1-5.

Abstract

In this paper,a new sorting method by code transforming and graded linking（GL,for short）is presented and its algorithm,flowcharts and the experimental results are given.The algorithmic analysis and results of experiment show that in the case of processing uniform-distributed data with the method of GL,the time complexity shall be O（N）,and memory cost shall be 2∈N （∈≤1）.The sorting speed is obviously quicker than that of OUICK SORT or sorting method of code transformation, graded computing and insertional relocations.

FullText(HTML)

Turn off MathJax

Article Contents

Export File