0% found this document useful (0 votes)
3 views3 pages

Java Array Manipulation Techniques

Uploaded by

liadpeer18
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
3 views3 pages

Java Array Manipulation Techniques

Uploaded by

liadpeer18
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

int[] a = {2,4,5,2,5};

int[] b = new int[[Link]];


for(int i = 0; i<[Link];i++) {
b[i] = a[i]*2;

int[] a = new int[10];


for(int i = 0; i<[Link];i++) {
a[i]= a[i+1]*10;

int[] a = new int[10];


int adder = 1;
for(int i = 0; i<[Link];i++) {
a[i]= prev+adder;
adder+=2;
prev = a{i};

int[] a = new int[10];


int prev = 1;
for(int i = 0; i<[Link];i++) {
if(i%2 == 0)
a[i] = 0;
else
a[i] = prev;
prev+=2;

int[] a = new int[10];


int adder = 3;
int prev = 0;
for(int i = 0; i<[Link];i++) {
a[i] = prev + adder;
prev = a[i];
}

int[] a = new int[10];


int minuser = 2;
int prev = 2;
for(int i = 0; i<[Link];i++) {
a[i] = prev - minuser;
prev = a[i];

int[] a = new int[10];


int adder = 1;
int prev = 7;
for(int i = 0; i<[Link];i++) {
a[i] = prev + adder;
prev = a[i];
adder ++;
}

int[] a = {1,2,3,2,1,5,6,7,4,3,6,7};
int counter = 0;
int max = Integer.MIN_VALUE;
int min = Integer.MAX_VALUE;
for(int i = 0; i<[Link];i++) {
if(a[i]>max)
max = a[i];
else if(a[i]<min)
min = a[i];
}
for(int i = 0; i<[Link];i++) {
if(a[i]==max) {
counter++;
[Link](i);
}
}
[Link](max);
[Link](min);
[Link](counter);

int[] a = {1,2,3,2,1,5,6,7,4,3,6,7};
int sum = [Link]();
for(int i = 0; i<[Link];i++) {
sum+=a[i];
}
int counter = 0;
for(int i = 0; i<[Link];i++) {
if(a[i]!=(sum/[Link]))
counter++;
}
[Link](counter);

int[] a = {1,2,3,2,1,5,6,7,4,3,6,7};
int sum_n=0;
int sum_p=0;
for(int i = 0; i<[Link];i++) {
if([Link]%2==0)
sum_p+=a[i];
else
sum_n+=a[i];
}
if(sum_p==sum_n)
[Link]("sums arethe same");

int[] a = {2,2,2,2,2,2};
int check = a[0];
boolean isequal =true;
for(int i = 0; i<[Link];i++) {
if(check==a[i])
isequal=true;
else
isequal=false;
}
if(isequal)
[Link]("equal");
else
[Link]("not equal");

int[] a = {1,2,3,4,5};
int check = a[1];
int prev = a[0];
boolean isequal =true;
for(int i = 2; i<[Link];i++) {
if(check-prev==1)
isequal=true;
else
isequal=false;
prev = check;
check=a[i];
}
if(isequal)
[Link]("‫;)"עולה‬
else
[Link]("‫;)"לא עולה‬

You might also like