Performance Analysis of Sort Algorithm
Jia Da
Abstract
Jia Da
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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