Hi everyone,

I am an electrical engineering student, and i am in my senior year and i am working on my senior project and i have never worked with java before but my project needs a java code version of my algorithm. so if anybody can help me with it, i would really appreciate it.

Here is the algorithm:

The lowest magnitude difference algorithm will be explained in details below:
〖AP〗_1=a,〖AP〗_2=b,〖 AP〗_3=c ,〖 AP〗_4=d
x→[x_a,x_b,x_c,x_d ]
y→[y_a,y_b,y_c,y_d ] .............

p_1=[a_1,b_1,c_1,d_1]
p_2=[a_2,b_2,c_2,d_2 ]
p_3=[a_3,b_3,c_3,d_3]

|p_1-x|=√([(〖a_1-x_a)〗^2+(〖b_1-x_b)〗^2+(〖c_1-x_c)〗^2+(〖d_1-x_d)〗^2 ] )=α dB
|p_2-x|=√([(〖a_2-x_a)〗^2+(〖b_2-x_b)〗^2+(〖c_2-x_c)〗^2+(〖d_2-x_d)〗^2 ] )=β dB
|p_3-x|=√([(〖a_3-x_a)〗^2+(〖b_3-x_b)〗^2+(〖c_3-x_c)〗^2+(〖d_3-x_d)〗^2 ] )=γ dB

The smallest value of β,γ,α is the right location match to where the client is.
e.g., if β is the smallest, then p_2≈x

thanks in advance for any help ... i really need it