ScholarLens Back to search
2011•Jisuanji gongchengRequires access

Study of High Efficiency Quick Sort Algorithm

Tang Ya-ling, Feng Qin

Open publisher page 2 citations

Abstract

Quick sort works fairly efficiently contrasting with other sort algorithms,but it has choke point when sorted data are in order or basically in order.This paper brings forward a new high efficient quick sort algorithm comparing with several algorithms whose performances are O(nlbn).And on theory analysis as well as experiment data,it proves fairly good sort performance and strong robustness even in case of data sorted or basically in order comparing with other sort algorithms.

About this research paper

What this paper is about

Quick sort works fairly efficiently contrasting with other sort algorithms,but it has choke point when sorted data are in order or basically in order.This paper brings forward a new high efficient quick sort algorithm comparing with several algorithms whose performances are O(nlbn).And on theory analysis as well as experiment data,it proves fairly good sort performance and strong robustness even in case of data sorted or basically in order comparing with other sort algorithms.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Quick sort works fairly efficiently contrasting with other sort algorithms,but it has choke point when sorted data are in order or basically in order.This paper brings forward a new high efficient quick sort algorithm comparing with several algorithms whose performances are O(nlbn).And on theory analysis as well as experiment data,it proves fairly good sort performance and strong robustness even in case of data sorted or basically in order comparing with other sort algorithms.

Key concepts: sort, Computer science, Sorting algorithm, Algorithm, Robustness (evolution), Merge sort, Database, Chemistry

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Study of High Efficiency Quick Sort Algorithm — Research Paper | ScholarLens