冒泡排序
package Array;
import java.util.Arrays;
import java.util.Scanner;
public class ArrayDemo05 {
public static int[] BubbleSort(int[] arr){
for (int i = 0; i < arr.length - 1; i++) {
boolean flag = false;
for (int j = 0; j < arr.length - 1 - i; j++) {
if (arr[j+1] < arr[j]){
swap(arr,j,j+1);
flag = true;
}
}
if (flag == false){
break;
}
}
return arr;
}
public static void swap(int[] arr,int i,int j){
int temp;
temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
public static void main(String[] args) {
int[] arr = new int[5];
int[] arr2 =new int[5];
Scanner scanner = new Scanner(System.in);
for (int i = 0; i < 5; i++) {
arr[i] = scanner.nextInt();
}
arr2 = BubbleSort(arr);
System.out.print(Arrays.toString(arr2));
}
}