2015•Computer Knowledge and TechnologyRequires access

Performance Analysis of Sort Algorithm

Jia Da

Open publisher page 0 citations

Abstract

Sort is a important operation in computer data processing.Based on disscussing briefly the idea and implementation process of different sort algorithm about straight insertion sort,quick sort,simple selection sort,heap sort and merging sort,a detailedperformance analysis is finished according to experiment test for different cases including record data distribution without regularpattern, initial record order or basic order and select k items from n records(n is large) and so on.It is achieved that how to improvesort algorithm efficiency for different data distribution.

About this research paper

What this paper is about

Sort is a important operation in computer data processing.Based on disscussing briefly the idea and implementation process of different sort algorithm about straight insertion sort,quick sort,simple selection sort,heap sort and merging sort,a detailedperformance analysis is finished according to experiment test for different cases including record data distribution without regularpattern, initial record order or basic order and select k items from n records(n is large) and so on.It is achieved that how to improvesort algorithm efficiency for different data distribution.

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

Sort is a important operation in computer data processing.Based on disscussing briefly the idea and implementation process of different sort algorithm about straight insertion sort,quick sort,simple selection sort,heap sort and merging sort,a detailedperformance analysis is finished according to experiment test for different cases including record data distribution without regularpattern, initial record order or basic order and select k items from n records(n is large) and so on.It is achieved that how to improvesort algorithm efficiency for different data distribution.

Key concepts: sort, Computer science, Sorting algorithm, Algorithm, Merge sort, Process (computing), Database, Programming language

Related papers

Back to paper searchBrowse research topicsOriginal source
Performance Analysis of Sort Algorithm — Research Paper | ScholarLens