Why does binary search need the array to be sorted first?

Binary search checks the middle item and throws away the half that cannot contain the target. That only works if the data is sorted, because then everything to one side of the middle is known to be smaller and everything to the other side larger. On unsorted data there is no way to know which half to throw away.