"Data Structure"--Sorting algorithm--3.1, select sort

"Data Structure"--Sorting algorithm--3.1, select sort

First, on the wiki map:

Classification	Sorting algorithms
Data	Array
Worst-of-time complexity	It (N2)
Optimal time complexity	It (N2)
Average Time complexity	It (N2)
Worst-of-space complexity	it (n) total, O (1)Auxiliary

Second, Description:

The selection algorithm is the most intuitive one. Each time a maximum (or minimum) value is drawn in the queue. Each time you need to traverse an element queue that has not been extracted.

Third, Java program:

static void Selection_sort (int[] unsorted) {for    (int i = 0;i < unsorted. Length-1; i++)    {      int min = unsorted[i], min_index = i;      for (int j = i+1; J < unsorted. Length; J + +)     {       if (Unsorted[j] < min)      {        min = unsorted[j];        Min_index = j;       }      }     if (min_index! = i)    {     int temp = unsorted[i];     Unsorted[i] = Unsorted[min_index];     Unsorted[min_index] = temp;}}    }

"Data Structure"--Sorting algorithm--3.1, select sort