The following code is an example of a ___ search.

public static int search(int[] a, int v) { for (int i = 0; i < a.length; i++) { if (a[i] == v) { return i; } } return -1; }

linear

binary

random

sorted

Can you search the following array using binary search?

int[] A = {6, 5, 4, 2, 0, 1, -1, -17};

No, negative numbers are not allowed because they indicate that a value is not present.

Yes. Binary search can be applied to any array.

Yes, but the algorithm runs slower because the array is in descending order.

No. Binary search can be applied to a sorted array only.