I have a question, about verifying the value which are near to each other in such row, Is there any algorithm which can determine that ?
Suppose I have a vector $z_i =$ {$z_1 , z_2, z_3, . . . ., z_n$}, I want first to determine the maximum and minimum values of this vector, then check if the distance between each other value is smaller compare then maximum and to minimum values. In other words, it means dividing the vector into two categories and then check if the value is nearer to first category or second.
Is there any algorithm can do that?
thank you