Package com.ctgu.java.exer;public class testarray3 {public static void main (String[] args) {int[] arr = new int[]{12,43,9,0,-65,-99,100,9};int max = arr[0];for (int i = 1; i < arr.length;i++ ) {if (Max < arr[i]) {max = arr[i];}} System.out.println ("Maximum array value:" + max); Int min=arr[0];for (int i = 1;i< arr.length;i++) {if (Min >arr[i]) {min = arr[i];}} SYSTEM.OUT.PRINTLN ("Array minimum is:" + min); Int sum = 0;for (int i = 0; i < arr.length; i++) {sum +=arr[i];} System.out.println ("Sum of:" +sum);int avg = 0;avg = sum / arr.length; System.out.println ("average:" +avg ); // array element copy int [] arr1 = new int[arr.length];for (Int i = 0 ; i < arr1.length;i++) {arr1[i] = arr[i];} The inverse of the array element//for (int i = 0; i< arr.length/2 ; i++) {//int temp = arr[i];//arr[i] = arr[arr.length-1 - i];//arr[arr.length-1-i]=temp;//}//Inversion 2for (int x = 0 , y = arr.length - 1; x < y;x++,y--) {int temp = arr[x];arr[x] = arr[y];arr[y] = temp ;} for (int i = 0; i < arr.length; i++) {System.out.print (arr[i] + "\ t");} Bubble sort from small to large//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]) {//int temp = arr[j];//arr[j] = arr[j + 1];//arr[j + 1] = temp ;//}//}//}//Direct Select sort small for (int i = 0; i < arr.length;i++) {int t = i;for (int j =i ;j < arr.length - 1;j++) {if (Arr[t]>arr[j]) {t=j;}} if (t != i) {int temp = arr[t];arr[t] = arr[i];arr[i] = temp;}} System.out.println ("After sorting:"); for (int i = 0; i < arr.length; i++) { System.out.print (arr[i] + "\ t");}}}
Bubble Sort Direct Sort study notes