Java基础部分-数组和简单算法

1.求得数组中元素的最大值和最小值

/** * 获取一个数组的最大值和最小值 * @author Pioneer **/ public class ArrayDemo{ public static void main(String[] args){ int[] array = new int[]{24,54,95,35,632,451,13,535,22,33}; int max = array[0]; int min = array[0]; for(int i = 0;i < array.length;i++){ if(array[i] > max){ max = array[i]; } if(array[i] < min){ min = array[i]; } } System.out.println("max = " + max); System.out.println("min = " + min); } }

2.对一维数组按照升幂排序

/** * 冒泡排序，升幂 * @author Pioneer **/ public class ArrayDemo2{ public static void main(String[] args){ int[] array = new int[]{24,54,95,35,632,451,13,33}; System.out.println("数组长度 ：" + array.length); for(int first = 1;first < array.length;first++){ for(int second = 0; second < array.length;second++){ if(array[first] < array[second]){ int tmp = array[first]; array[first] = array[second]; array[second] = tmp; } } System.out.print("第" + first + "次排序结果："); for(int i = 0 ; i < array.length; i++){ System.out.print(array[i] + "\t"); } System.out.println(); } } }

3.对一维数组按照降幂排序

/** * 冒泡排序，降幂 * @author Pioneer **/ public class ArrayDemo3{ public static void main(String[] args){ int[] array = new int[]{24,54,95,35,632,451,13,33}; System.out.println("数组长度 ：" + array.length); for(int first = 1;first < array.length;first++){ for(int second = 0; second < array.length;second++){ if(array[first] > array[second]){ int tmp = array[first]; array[first] = array[second]; array[second] = tmp; } } System.out.print("第" + first + "次排序结果："); for(int i = 0 ; i < array.length; i++){ System.out.print(array[i] + "\t"); } System.out.println(); } } }