Hua Jiang
Abstract
This paper presents a quick sorting algorithm of real , and provides its analysis and core source program . Its time complexity is O (N) , and its appended storage space is very small . The algorithm particularly suits to the situation of large amounts of data .
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.
This paper presents a quick sorting algorithm of real , and provides its analysis and core source program . Its time complexity is O (N) , and its appended storage space is very small . The algorithm particularly suits to the situation of large amounts of data .
Key concepts: Computer science, Sorting, Sorting algorithm, Algorithm, Core (optical fiber), Telecommunications