This article mainly introduces Java data structures and algorithm examples: Selection Sort. This article directly gives the implementation code. The code contains detailed comments. Friends in need can refer to it
/** * 选择排序的思想: * 每次从待排序列中找到最小的元素, * 然后将其放到待排的序列的最左边,直到所有元素有序 * * 选择排序改进了冒泡排序,将交换次数从O(N^2)减少到O(N) * 不过比较次数还是O(N) */ package al; public class SelectSort { public static void main(String[] args) { SelectSort selectSort = new SelectSort(); int[] elements = { 14, 77, 21, 9, 10, 50, 43, 14 }; // sort the array selectSort.sort(elements); // print the sorted array for (int i = 0; i < elements.length; i++) { System.out.print(elements[i]); System.out.print(" "); } } /** * @author * @param array 待排数组 */ public void sort(int[] array) { // min to save the minimum element for each round int min, tmp; for(int i=0; i<array.length; i++) { min = i; // search for the minimum element for(int j=i; j<array.length; j++) { if(array[j] < array[min]) { min = j; } } // swap minimum element tmp = array[i]; array[i] = array[min]; array[min] = tmp; } } }
[Related recommendations 】
1. java data structure sorting algorithm (1) tree selection sort
2. java data structure sorting algorithm (2) merge sort
3. java data structure sorting algorithm (3) simple selection sort
4. java data structure sorting algorithm (4) selection sort
The above is the detailed content of Detailed tutorial on selection sorting in Java (Selection Sort_java). For more information, please follow other related articles on the PHP Chinese website!