2.11 closest point

A one-dimensional array contains N numbers in total, and returns the minimum difference of two numbers: doubleMinDifference (doublearr [], intn) {if (n2) return0; doublefMinDifffabs (arr [0]-arr [1]); for (inti0; in; I) for (intji1; jn; j) {doubletmpfabs (arr [I]-arr [j]); if (fMinDifftmp) {fMinDifftmp ;}

A one-dimensional array contains N numbers in total, and returns the minimum difference of two numbers. double MinDifference (double arr [], int n) {if (n2) return 0; double fMinDiff = fabs (arr [0]-arr [1]); for (int I = 0; in; I) for (int j = i1; jn; j) {double tmp = fabs (arr [I]-arr [j]); if (fMinDifftmp) {fMinDiff = tmp ;}

A one-dimensional array contains N numbers in total, and returns the smallest difference between the two numbers.

Double MinDifference (double arr [], int n)

{

If (n <2)

Return 0;

Double fMinDiff = fabs (arr [0]-arr [1]);

For (int I = 0; I

For (int j = I + 1; j

{

Double tmp = fabs (arr [I]-arr [j]);

If (fMinDiff> tmp)

{

FMinDiff = tmp;

}

}

Return fMinDiff;

}