传递一个数组,要求对数组进行冒泡排序,返回排序后的数组【有参有返回值】
提示:参数为int[], 返回值也是int[]
public class Demo5 {
public int[] show(int[] arr) {
int[] arr1 = null;
for (int i = 0; i < arr.length-1; i++) {//需要进行length-1次
//内层循环,比较多少次,每次比较后会得出一个最大值
for (int j = 0; j < arr.length-1-i; j++) {
//交换二个数从小到大
if(arr[j]>arr[j+1]) {
int t = arr[j];
arr [j] = arr[j+1];
arr[j+1] = t ;
}
}
}
arr1 = arr;
return arr1;
}
public static void main(String[] args) {
Demo5 demo5 = new Demo5();
int[] arr1 = {5, 8, 9, 4, 7, 6};
int[] yi = demo5.show(arr1);
for (int n : yi) {//遍历数组输出
System.out.print(n + " ");
}
}
}
一个数组, 要求对数组反转,返回反转后的数组【有参有返回值】
public class Demo5 {
public int[] show(int[] arr) {
int[] arr1 = null;
for (int i = 0; i < arr.length / 2; i++) {
int tem = arr[i];
arr[i] = arr[arr.length - 1 - i];
arr[arr.length - 1 - i] = tem;
}
arr1 = arr;
return arr1;
}
public static void main(String[] args) {
Demo5 demo5 = new Demo5();
int[] arr1 = {1, 2, 3, 4, 5, 6};
int[] yi = demo5.show(arr1);
for (int n : yi) {//遍历数组输出
System.out.print(n + " ");
}
}
}