Hi Justin, you're right.
By the way, the satements
No insert Point --> -1
At 0 --> -2
At 1 --> -3
At 2 --> -4
At 3 --> -5
are wrong. -1 is returned, if the the element used in binarySearch is less than the smallest element in the array (that is, it has to be inserted at position 0 to keep the array sorted). Let a = {0,2,4,6,8}. Than Arrays.binarySearch(a,1) would return -2, because 1 has to be inserted at index position 1 to keep the array sorted. And so on.
-----------------------------------------
SCJP 1.5 (98%)