package sorting;
public class SelectionSort {//选择排序
public static void main(String[] args) {
int[] a = { 49, 38, 65, 97, 76, 13, 27, 49, 78, 34, 12, 64, 1, 8 };
System.out.println("排序之前:");
for (int i = 0; i < a.length; i++) {
System.out.print(a[i] + " ");
}
// 简单的选择排序
for (int i = 0; i < a.length; i++) {
int min = a[i];
int n = i; // 最小数的索引
for (int j = i + 1; j < a.length; j++) {
if (a[j] < min) { // 找出最小的数
min = a[j];
n = j;
}
}
a[n] = a[i];
a[i] = min;
}
System.out.println();
System.out.println("排序之后:");
for (int i = 0; i < a.length; i++) {
System.out.print(a[i] + " ");
}
}
}
数据结构八种基本序列代码-----选择排序
猜你喜欢
转载自blog.csdn.net/qq_42866384/article/details/81393630
今日推荐
周排行