A branch table allows the program to determine which branch to execute with a single calculation instead of comparing values in a sequence. A binary search takes only a logarithmic number of comparisons, measured in the number of cases in the switch statement. Generally, the only way to determine whether the code was optimized in this way, is by analyzing the compiler output such as assembly or machine code.

; Less complex: In terms of a control-flow graph,