Question

A technique for speeding up iterations of this algorithm involves augmenting each node in a catalog graph with one over d elements from each adjacent node, where d is a degree bound. That technique, called fractional cascading, lets you run this algorithm once and get the rest in constant time. Most cheap analog-to-digital converters use a successive approximation register architecture, which implements this algorithm. An anecdote in Programming Pearls notes that, given a couple hours, 90 percent of programmers still (*) failed to correctly implement this algorithm. The user specifies (-5[1])“bad” or “good” to determine which commit introduced a bug in a git tool that implements this algorithm. (10[1])Most implementations of this algorithm repeatedly set a middle variable to the average of low and high variables. (10[1])For 10 points, (10[1])name this algorithm that finds an object in a sorted list by repeatedly dividing it in half. ■END■ (10[1])

Back to tossups