-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMain_29.java
More file actions
72 lines (72 loc) · 2.21 KB
/
Main_29.java
File metadata and controls
72 lines (72 loc) · 2.21 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
public class Main_29 {
public static void main(String[] args) {
float[] arr1={43.5f, 56.7f, 23.7f, 12.7f, 98.5f};
float sum=0.0f;
for (float i: arr1){
sum=sum+i;
}
System.out.println("Sum of elements="+sum);
int[] arr2={23, 67, 84, 39, 54};
for (int i=0; i<arr2.length; i++){
if (23==arr2[i]) {
System.out.println("found at position " + (i + 1));
break;
}
}
float[] arr3={43f, 67f, 58f, 40f, 28f};
float sum1=0;
for (float i: arr3){
sum1=sum1+i;
}
System.out.println("Average of marks is "+(sum1/arr3.length));
int[][] arr4={{1, 2, 3}, {4, 5, 6}};
int[][] arr5={{7, 8, 9}, {10, 11, 12}};
int[][] arr6={{0,0,0}, {0,0,0}};
for (int i=0; i<arr4.length; i++){
for (int j=0; j<arr4[i].length; j++){
arr6[i][j]=arr4[i][j]+arr5[i][j];
}
}
System.out.println("sum array is:");
for (int i=0; i<arr6.length; i++){
for (int j=0; j<arr6[i].length; j++){
System.out.print(arr6[i][j]);
System.out.print("\t");
}
System.out.print("\n");
}
int temp;
int n=Math.floorDiv(arr2.length,2);
System.out.println("reverse array is:");
for (int i=0; i<n; i++){
temp=arr2[i];
arr2[i]=arr2[arr2.length-i-1];
arr2[arr2.length-i-1]=temp;
}
for(int i:arr2){
System.out.print(i);
System.out.print("\t");
}
System.out.print("\n");
int max=arr2[0];
int min=arr2[0];
for(int i:arr2){
if (i>max)
max=i;
if (i<min)
min=i;
}
System.out.println("maximum element is "+max+" and minimum is "+min);
boolean sort=true;
for(int i=0; i<arr2.length; i++){
if (arr2[i]>arr2[i+1]){
sort=false;
break;
}
}
if (sort)
System.out.println("Array is sorted");
else
System.out.println("Array is not sorted");
}
}