ScholarLens Back to search
2014•Computer and Digital EngineeringRequires access

Improved Parallel Quick Sort

Xiangjia Liu

Open publisher page 0 citations

Abstract

Sorting is a very time consuming problem in computer.Quick sort is relatively time-saving among many way of sorting algorithms.As for large amounts of data,its time consuming is amazing.In order to solve the problem of big data quick sort time consuming,in this paper,on the basis of the commonly-used quick sort of parallel method,an improved method is given to make improvement in time complexity.

About this research paper

What this paper is about

Sorting is a very time consuming problem in computer.Quick sort is relatively time-saving among many way of sorting algorithms.As for large amounts of data,its time consuming is amazing.In order to solve the problem of big data quick sort time consuming,in this paper,on the basis of the commonly-used quick sort of parallel method,an improved method is given to make improvement in time complexity.

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

Sorting is a very time consuming problem in computer.Quick sort is relatively time-saving among many way of sorting algorithms.As for large amounts of data,its time consuming is amazing.In order to solve the problem of big data quick sort time consuming,in this paper,on the basis of the commonly-used quick sort of parallel method,an improved method is given to make improvement in time complexity.

Key concepts: Computer science, sort, Sorting algorithm, Sorting, Parallel computing, Algorithm, Database

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Improved Parallel Quick Sort — Research Paper | ScholarLens