public class MaoPao {
//冒泡排序
public static void main(String[] args) {
int arr[]={1,8,4,6,9,7};
for (int i = 0; i <arr.length-1 ; i++) {
for (int j = 0; j < arr.length - 1 - i; j++) {
int temp = 0;
if (arr[j] > arr[j + 1]) {
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
//遍历结果
for (int i = 0; i <arr.length ; i++) {
System.out.print(arr[i]+" , ");
}
}
}
选择排序
public class SelectSort {
//选择排序
public static void main(String[] args) {
int arr[] = {1, 5, 3, 17, 8, 47, 2};
// 使用直接选择排序使数组元素从小到大排列
for (int i = 0; i < arr.length - 1; i++) {
int t = i;//默认i处是最小的
for (int j = i; j < arr.length; j++) {
//一旦在i后发现存在比其小的元素,就记录那个元素的下角标
if (arr[t] > arr[j]) {
t = j;
}
}
if (t != i) {
int temp = arr[t];
arr[t] = arr[i];
arr[i] = temp;
}
}
for (int i = 0; i <arr.length ; i++) {
System.out.print(arr[i]+" ");
}
}
}