Need help with these about Algorithms.

Question 1 Suppose n points lying on a horizontal axis are given by their coordinates x[0], X[1], ... , X[n-1). The distance between points i and jis x[i] - [j] . The task is to find the distance between two nearest points. For example, given 5 points with coordinates 8, 1, 15, 3, 12, the two nearest points have coordinates 1 and 3 and the distance is 11 - 31=2. The two algorithms Al and A2 are presented below. ALGORITHM Al (x[0..n-1]) // Input: array x[o..n-l] of x-coordinates of n points on X-axis 11 Output: the distance between two nearest points minDist + x[0] - X[1] | for it to n-2 do for j i +l to n-1 do Distance + x[i] - [j] | if Distance