A central domain registry contains 2302^{30}230 (approximately 1.07×1091.07 \times 10^91.07×109) active website domain records sorted in alphabetical order.
Explain, with reference to the maximum number of comparison steps required by each method, why a binary search algorithm is far more efficient than a linear search algorithm when locating a specific domain record in this registry.