-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathArrayBasics.java
More file actions
76 lines (69 loc) · 1.38 KB
/
Copy pathArrayBasics.java
File metadata and controls
76 lines (69 loc) · 1.38 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
73
74
75
76
import java.util.Scanner;
class ArrayBasics
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("enter n value:");
int n=sc.nextInt();
int arr[]=new int[n];
System.out.println("enter array elements:");
for(int i=0;i<n;i++)
{
arr[i]=sc.nextInt();
}
System.out.println("array elements are:");
for(int i=0;i<n;i++)
{
System.out.println(arr[i]);
}
System.out.println("Array sum is:");
int sum=0;
for(int i=0;i<n;i++)
{
sum+=arr[i];
}
System.out.println(sum);
System.out.println("maximum element:");
int max=arr[0];
for(int i=1;i<n;i++)
{
if(arr[i]>max)
{
max=arr[i];
}
}
System.out.println(max);
System.out.println("minimum element:");
int min=arr[0];
for(int i=1;i<n;i++)
{
if(arr[i]<min)
{
min=arr[i];
}
}
System.out.println(min);
System.out.println("count even elements:");
int count=0;
for(int i=0;i<n;i++)
{
if(arr[i]%2==0)
count++;
}
System.out.println(count);
System.out.println("count odd elements:");
int oddCount=0;
for(int i=0;i<n;i++)
{
if(arr[i]%2!=0)
oddCount++;
}
System.out.println(oddCount);
System.out.println("reverse elements:");
for(int i=arr.length-1;i>=0;i--)
{
System.out.println(arr[i]);
}
}
}