What key aspect of both the binary search and the merge sort accounts for the logarithmic portion of their respective Big Os?

What will be an ideal response?

Both of these algorithms incorporate “halving”—somehow reducing something by half. The binary search eliminates from consideration half of the array after each comparison. The merge sort splits the array in half each time it’s called.