对10的成绩按照从低到高的顺序排列 (三种方式)
1.冒泡排序
public class Bubblesortmax {
public static void main(String[] args) {
int[] arr={1,2,9,-100,-55,23,-99,0,3,4,8};
bubblesort(arr);
for (int i:arr){
System.out.print(i+", ");
}
}
public static void bubblesort(int[] arr){
for (int i=0;i<arr.length-1;i++){
for (int j=0;j<arr.length-1-i;j++){
if(arr[j]>arr[j+1]){
swap(arr,j,j+1);
}
}
}
}
public static void swap(int[] arr, int i, int j) {
arr[i]=arr[i]+arr[j];
arr[j]=arr[i]-arr[j];
arr[i]=arr[i]-arr[j];
}
}
2.选择排序
public class Selectsort {
public static void main(String[] args) {
int[] arr={1,2,9,-100,-55,23,-99,0,3,4,8};
selectsort02(arr);
for (int i:arr){
System.out.print(i+", ");
}
}
private static void selectsort02(int[] arr) {
for (int i=0;i<arr.length-1;i++) {
for (int j = i; j < arr.length; j++) {
if (arr[i] > arr[j]) {
swap(arr,i,j);
}
}
}
}
public static void selectsort(int[] arr) {
for (int i=0;i<arr.length-1;i++){
int min =i;
for (int j=i;j<arr.length;j++){
if (arr[min]>arr[j]){
min =j;
}
}
if (min!=i){
swap(arr,i,min);
}
}
}
public static void swap(int[] arr, int i, int j) {
arr[i]=arr[i]+arr[j];
arr[j]=arr[i]-arr[j];
arr[i]=arr[i]-arr[j];
}
}
3.插入排序
public class Insertsort {
public static void main(String[] args) {
int[] arr={1,2,9,-100,-55,23,-99,0,3,4,8};
insertsort(arr);
for (int i:arr){
System.out.print(i+", ");
}
}
public static void insertsort(int[] arr) {
for (int i=1;i<arr.length;i++){
for (int j=i;j>0 && arr[j]<arr[j-1];j--){
swap(arr,j,j-1);
}
}
}
public static void swap(int[] arr, int i, int j) {
arr[i]=arr[i]+arr[j];
arr[j]=arr[i]-arr[j];
arr[i]=arr[i]-arr[j];
}
}
某个人进入如下一个棋盘中,要求从左上角开始走, 最后从右下角出来(要求只能前进,不能后退), 问题:共有多少种走法?
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
public class Theborad {
public static int getTraversal(int p, int q) {
int num = 0;
if (p == 1 && q == 1) {
return 1;
}
if (p > 1) {
num += getTraversal(p - 1, q);
System.out.print(num+", ");
}
if (q > 1) {
num += getTraversal(p, q - 1);
System.out.print(num+", ");
}
return num;
}
public static void main(String[] args) {
int num = getTraversal(2, 3);
System.out.println(num);
}
}