Consider the following algorithm for finding the distance between the two closest elements in an array of numbers.
ALGORITHM MinDistance(A[0..n − 1])
//Input: Array A[0..n − 1] of numbers
//Output: Minimum distance between two of its elements
dmin←∞
for i ←0 to n − 1 do
for j ←0 to n − 1 do
if i j and |A[i]− A[j ]| < dmin
dmin ←|A[i]− A[j ]|
return dmin
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.