Jianqin Zhou
Abstract
Sorting algorithms were widely studied in both theory and algorithm design.Combining insertion sort,quick sort and merge sort,a new sort algorithm called combination sort is proposed.The time complexity and space complexity of the new algorithm is much better than that of insertion sort,quick sort and merge sort.
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.
Sorting algorithms were widely studied in both theory and algorithm design.Combining insertion sort,quick sort and merge sort,a new sort algorithm called combination sort is proposed.The time complexity and space complexity of the new algorithm is much better than that of insertion sort,quick sort and merge sort.
Key concepts: Sorting algorithm, sort, Computer science, Merge sort, Algorithm, Information retrieval