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?1do
for j ?0 to n?1do
if i =j and|A[i]?A[j]|< dmin
dmin?|A[i]?A[j]|
return dmin
what is best case worst case and average case of thisalgorithm???
Expert Answer
An answer will be send to you shortly. . . . .