ALGORITHM MinDistance (A[0..n-1]) //Input: Array A[0..n-1] of numbers //Output: Minimum distance between two of its elements dmin co for i 0 ton - 1 do for j-0 to n-1 do return dmin if i j and A[i] - A[j]|