用java实现选择排序算法
public static void main(String[] args) { int[] arr = {12, 65, 1, 0, 58, 46, 21}; int[] sort = pickSort(arr); for (int i = 0; i < sort.length; i++) { System.out.print(arr[i] + "\t"); } } private static int[] pickSort(int[] arr) { for (int i = 0; i < arr.length; i++) { for (int j = i + 1; j < arr.length; j++) { if (arr[i] > arr[j]) { int temp=arr[i]; arr[i] = arr[j]; arr[j]=temp; } } } return arr; }结果:0 1 12 21 46 58 65
import java.util.Arrays;
public class 选择排序 {
public static void main(String[] args) {
int[] is = new int[] {1,4,-1,9,100,34,23};
for (int i = 0; i < is.length; i++) {
int min = is[i];
int indexMin = i;
for(int j = i+1; j < is.length; j++) {
if(min > is[j]) {
min = is[j];
indexMin = j;
}
}
int temp = is[i];
is[i] = min;
is[indexMin] = temp;
}
String string = Arrays.toString(is);
System.out.println(string);
}
}
public class Main{ public static void main([] args){ Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int []num; for(int i = 0; i < n; i++){ num[i] = sc.nextInt(); } int temp = 0; for(int i = 0; i < n; i++){ temp = num[i]; if(temp > num[i+1]){ num[i] = num[i+1]; num[i+1] = temp[i]; }else{ temp = num[i+1]; } for(int i = 0;i < n;i++){ System.out.println(num[n]+" "); } } } }
//简单选择排序算法 public void selectSort(int[] a, int len) { for ( int i = 0; i < a.length; i++ ) { //标记当前元素下标 int index = i; //在其后找到最小元素的下标 for ( int j = i; j < a.length; j++ ) if(a[index] > a[j]) index = j; //交换两个元素 if( index != i ) { int t = a[i]; a[i] = a[index]; a[index] = t; } } }
private void selectSort(int[] data) {int = minValueIndex;int = temp;for(inti = 0; i < data.length-1; i++) {minValueIndex = i;for(intindex = i+1; index < data.length-1; index++) {if(data[index] < data[minValueIndex]) {minValueIndex = i;}}if(minValueIndex != i) {temp = data[minValueIndex];data[minValueIndex] = data[i];data[i] = temp;}}}