The Page Header section prints ____.

If the goal is to find all points within a specified distance ? of point y, y = x, explain how you could use the triangle inequality and the al- ready calculated distances to x to potentially reduce the number of dis- tance calculations necessary? Hint: The triangle inequality, d(x, z) ? d(x, y) + d(y, x), can be rewritten as d(x, y) ? d(x, z) ? d(y, z).

You are given a set of points S in Euclidean space, as well as the distance of each point in S to a point x. (It does not matter if x ? S.)

(Tricky) What is the output of the following code:

``` #include using namespace std; int main() { int x[] = {120, 200, 16}; for (int i = 0; i < 3; i++) cout << x[i] << " "; } ``` A. 200 120 16 B. 16 120 200 C. 120 200 16 D. 16 200 120