Consider the following algorithm for finding the distance between the twoclosest 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 elementsdmin $\backslash$infty for i $0$ to n $1$ dofor j $0$ to n $1$ doif i $=$ j and $|$A$[$i$]$ A$[$j $]|<$ dmindmin $|$A$[$i$]$ A$[$j $]|$return dminMake as many improvements as you can in this algorithmic solution to theproblem. If you need to$,$ you may change the algorithm altogether; if not,improve the implementation given.