How does the binary search get better performance than the sequential search on an ordered list?
a.
The binary search relies on more efficient list access using a numeric index
b.
The binary search discards half of the possible elements after each comparison
c.
The binary search is written in machine code for the greatest speed on any CPU
d.
The binary and sequential searches actually perform about the same on sorted data