A Quick Sorting Algorithm Adaptive to Massive Data with High Repetition Rate

Bao Ping Chen

doi:10.4028/www.scientific.net/AMR.834-836.1002

Paper Titles

New ART2/ART2A Algorithm Apply to Entire Real Number Field
p.982

Signal Processing of Giant Magnetostritive Force Sensors
p.988

Image Processing Using Discrete Wavelet Transform Based on OMAP3530
p.994

Design of Intelligent Teaching System Based on Data Mining Technology
p.998

A Quick Sorting Algorithm Adaptive to Massive Data with High Repetition Rate
p.1002

A Noise Reduction Method of Interferogram Based on Discrete Wavelet Transform for Quantitative Calibration of near Infrared Spectra
p.1006

A New Image Fusion Method Based on Improved PCNN and Multiscale Decomposition
p.1011

The Processing of Laser Signal Based on Spatial Correlation Threshold Filtering in Foggy Media
p.1016

Research on the Enhancement and Processing of Faint Laser Signal in Foggy Conditions
p.1023

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 834-836A Quick Sorting Algorithm Adaptive to Massive Data...

A Quick Sorting Algorithm Adaptive to Massive Data with High Repetition Rate

Abstract:

Quick sorting is one of the sorting algorithms with good performance. However, there is a bottleneck of its performance in dealing with massive data with high repetition rate. Therefore, a new effective quick sorting algorithm is proposed in this study. This approach possesses the advantage of conciseness of quick sorting algorithms while avoiding the disadvantages of recursive algorithms. The time complexity is O(n), and the space complexity is O(1). Theoretical analysis and experimental data have shown that its performance is superior to the original quick sorting algorithm, and it is applicable to the processing of massive data with high repetition rate.

You might also be interested in these eBooks

Research in Materials and Manufacturing Technologies

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 834-836)

Pages:

1002-1005

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.834-836.1002

Citation:

Cite this paper

Online since:

October 2013

Authors:

Bao Ping Chen

Keywords:

Complexity, High Efficiency Quick Sort, Sort Algorithm

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Hoare C A R. QuickSort . The Computer, 1962, 15(1) : 10~15.

Google Scholar

[2] Xinpu Cao. Design and analysis of algorithms. Publishing House of Hunan , in 1984. 71~80.

Google Scholar

[3] Xiangyang Wang, HongyingYang. Fast Sorting Method of Separating Segment According Bit Field[J]. MINI- MICRO SYSTEM, 2001, Vo. l 22, No. 11: 1382~1385.

Google Scholar

[4] Hua Jiang, Xinxing Tan. A Study on non-comparative Sectional Sorting Algorithm. Computer Applications and Software, 2003, 2(4): 46~48.

Google Scholar

[1] .

Google Scholar

[5] Hua Jiang. NON-COMPARATIVE SECTIONAL SORTING ALGORITHM OF REAL. Computer Applications and Software, 2005, 22(3): 105~107.

Google Scholar

[6] Zhanxin Ma, Fengcai Ling. A Rapid Sorting Algorithm to Arrange the Order Based on Statistics. MINI- MICRO SYST EM, 2002, 23(11): 1403~1405.

Google Scholar