The Following Is the Pseudocode for Which Type of Algorithm

The following is the pseudocode for which type of algorithm?
Set first to 0
Set last to the last subscript in the array
Set found to False
Set position to -1
While found is not true and first is less than or equal to last
Set middle to the subscript halfway between array[first] and array[last]
If array[middle] equals the desired value
Set found to true
Set position to middle
Else If array[middle] is greater than the desired value
Set last to middle - 1
Else
Set first to middle + 1
End If
End While
Return position

A) linear sort
B) linear search
C) binary search
D) selection sort
E) None of these