ScholarLens Back to search
2012•IEEE SoftwareRequires access

Selective Sorting Algorithm from Both Ends in Arrays

Yuan Xiao-zhou

Open publisher page 0 citations

Abstract

The core computation commonly used in data processing is sorting. The percentage of CPU time used in sorting is from 20% to 60% in some business computers. This paper brings forward an optimized selective sorting algorithm by sorting from both ends simultaneously. Since the time of comparison in this sorting is only half of the commonly used selective sorting, the computer running time is greatly decreased, and the computer work efficiency is highly increased. This sorting method can be used as reference in other sorting algorithm.

About this research paper

What this paper is about

The core computation commonly used in data processing is sorting. The percentage of CPU time used in sorting is from 20% to 60% in some business computers. This paper brings forward an optimized selective sorting algorithm by sorting from both ends simultaneously. Since the time of comparison in this sorting is only half of the commonly used selective sorting, the computer running time is greatly decreased, and the computer work efficiency is highly increased. This sorting method can be used as reference in other sorting algorithm.

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

The core computation commonly used in data processing is sorting. The percentage of CPU time used in sorting is from 20% to 60% in some business computers. This paper brings forward an optimized selective sorting algorithm by sorting from both ends simultaneously. Since the time of comparison in this sorting is only half of the commonly used selective sorting, the computer running time is greatly decreased, and the computer work efficiency is highly increased. This sorting method can be used as reference in other sorting algorithm.

Key concepts: Sorting, Sorting algorithm, Computer science, Sorting network, Parallel computing, Computation, Algorithm

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Selective Sorting Algorithm from Both Ends in Arrays — Research Paper | ScholarLens