Question: I have the following java code: int z=0; while (z <75){ System.out.println(Math.sqrt((b1[z]-b[2]))*(b1[z]-b[2])+(c1[z]-c[2])*(c1[z]-c[2])+(d1[z]-d[2])*(d1[z]-d[2])+(e1[z]-e[2])*(e1[z]-e[2])); z++; } b,c,d, and e are arrays I am holding constant which token
I have the following java code:
int z=0;
while (z<75){
System.out.println(Math.sqrt((b1[z]-b[2]))*(b1[z]-b[2])+(c1[z]-c[2])*(c1[z]-c[2])+(d1[z]-d[2])*(d1[z]-d[2])+(e1[z]-e[2])*(e1[z]-e[2]));
z++; }
b,c,d, and e are arrays I am holding constant which token I am accessing, and b1,c1,d1,e1 I am iterating through the array. 75 values are given as output-- find the minimum value and which value of z result in this minimum.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
