Please help with my homework. Algorithm analysis.

I need to answer the five questions such as input size, basic operations, worst case and etc..

I am a little bit stuck on finding the worst-case; so please add some explanation for reference thank you!!

5. Consider the following algorithm for finding the distance between the two closest elements in an array of numbers. Algorithm Min Distance(A[O... - 1)) //Input: Array A[0.1 1] of numbers 7/Output: Minimum distance between two of its elements dmin - 00 for i 0 to n-1 do for j - 0 to n - 1 do if i * j and A[i] A[j]