ScholarLens Back to search
2004•Sichuan University of Science and TechnologyRequires access

New Time-Complexity Analysis of the Quick-Sorting Algorithm

Wen Song

Open publisher page 0 citations

Abstract

This paper proposes a rule of the asymptotic time-complexity analysis and average capability ones. To the problem of quick-sort, the authors give an average capacity analysis of the algorithm which is based on random choice 'pintle'.

About this research paper

What this paper is about

This paper proposes a rule of the asymptotic time-complexity analysis and average capability ones. To the problem of quick-sort, the authors give an average capacity analysis of the algorithm which is based on random choice 'pintle'.

Why it matters

A significance statement is not available in the OpenAlex record.

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

This paper proposes a rule of the asymptotic time-complexity analysis and average capability ones. To the problem of quick-sort, the authors give an average capacity analysis of the algorithm which is based on random choice 'pintle'.

Key concepts: Sorting algorithm, Algorithm, Sorting, sort, Computer science, Time complexity, Worst-case complexity, Mathematics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
New Time-Complexity Analysis of the Quick-Sorting Algorithm — Research Paper | ScholarLens