Investigation of Two Legs Choice Sort
Dai Wen-zheng
Abstract
Dai Wen-zheng
Abstract
Based on the analysis of choice-sorting algorithm,we find an efficient sorting method that can reduce the original sorting time.Using this method,after every sorting,we can find the largest and the smallest datum respectively among the collection of data elements to be sorted;then again sort the remained data by uses of this method until all the data become order.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
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.
Based on the analysis of choice-sorting algorithm,we find an efficient sorting method that can reduce the original sorting time.Using this method,after every sorting,we can find the largest and the smallest datum respectively among the collection of data elements to be sorted;then again sort the remained data by uses of this method until all the data become order.
Key concepts: Sorting, sort, Sorting algorithm, Computer science, Geodetic datum, Algorithm, Geography, Information retrieval