《java选择排序法》由会员分享，可在线阅读，更多相关《java选择排序法（1页珍藏版）》请在金锄头文库上搜索。
1、选择排序法(selection sort)： /*数组的选择排序*/public class SelectionSortpublic static void sort(int list)int index, smallestIndex;int size = list.length; for(index=0;indexsize-1;index+) smallestIndex = seekSmallestIndex(index, list); interchange(index,smallestIndex,list);/*找出元素中值最小的索引*/private static int seekSm
2、allestIndex(int startIndex, int list) int min = liststartIndex;int indexOfMin = startIndex;int index; for(index=startIndex;indexlist.length;index+) if(listindex min)min = listindex; indexOfMin = index;return indexOfMin;交换*/private static void interchange(int i, int j, int list) int temp;temp = listi;listi = listj;listj = temp;
