What are the selection sorting

Selection sorting includes simple selection sorting and heap sorting. Simple selection sorting is an intuitive sorting algorithm, while heap sorting generates a maximum heap from an unordered sequence, and combines the top element of the heap with the last element. Swap the positions of one element and generate the maximum heap with the remaining elements. Then exchange the elements one by one and generate the maximum heap.

Selection sort

• Simple selection sort

Simple Selection Sort is an intuitive sorting algorithm. In an unsorted sequence, the smallest element is selected and exchanged with the first element of the sequence, and then the remaining unsorted sequence is Then select the smallest element and exchange it with the second element of the sequence, and so on, finally forming a sorted sequence from small to large

Time complexity: O(N2)

• Heap sort

Generate an unordered sequence into a maximum heap, swap the top element of the heap with the last element, generate the remaining elements into a maximum heap, and proceed through the elements in sequence Swap and generate the maximum heap

Time complexity: O(NlogN) Space complexity: O(1)

The above is the detailed content of What are the selection sorting. For more information, please follow other related articles on the PHP Chinese website!