Is there an optimal sorting algorithm?

There is no optimal sorting algorithm, because no sorting algorithm is optimal under any circumstances. The optimal algorithm must be selected according to the actual situation to solve the problem; and sorting is often performed in computers. An operation whose purpose is to adjust a set of "unordered" record sequences into an "ordered" record sequence.

No sorting algorithm is optimal under any circumstances. The optimal algorithm must be selected to solve the problem based on the actual situation

Algorithm stability: In a set of records to be sorted, if there are any two equal records R and S, and R is before S in the records to be sorted, if R is still before S after sorting, that is Their front and rear positions do not change before and after sorting, then the sorting algorithm is called stable.

Related introduction:

Sorting is an operation often performed in the computer. Its purpose is to adjust a set of "unordered" record sequences into "ordered" records. sequence. It is divided into internal sorting and external sorting. If the entire sorting process can be completed without accessing external memory, then this kind of sorting problem is called internal sorting. On the contrary, if the number of records participating in the sorting is very large and the sorting process of the entire sequence cannot be completed in memory, this kind of sorting problem is called external sorting. The process of internal sorting is a process of gradually expanding the length of the ordered sequence of records.

The above is the detailed content of Is there an optimal sorting algorithm?. For more information, please follow other related articles on the PHP Chinese website!