<Li> A series of if - else conditionals that examine the target one value at a time . Fallthrough behavior can be achieved with a sequence of if conditionals each without the else clause . </Li> <Li> A lookup table, which contains, as keys, the case values and, as values, the part under the case statement . </Li> <Dl> <Dd> <Dl> <Dd> (In some languages, only actual data types are allowed as values in the lookup table . In other languages, it is also possible to assign functions as lookup table values, gaining the same flexibility as a real switch statement . See Control table article for more detail on this). </Dd> <Dd> Lua does not support case / switch statements: http://lua-users.org/wiki/SwitchStatement . This lookup technique is one way to implement switch statements in the Lua language, which has no built - in switch . </Dd> <Dd> In some cases, lookup tables are more efficient than non-optimized switch statements since many languages can optimize table lookups, whereas switch statements are not optimized unless the range of values is small with few gaps . A non-optimized, non-binary search lookup, however, will almost certainly be slower than either a non-optimized switch or the equivalent multiple if - else statements . </Dd> </Dl> </Dd> </Dl> <Dd> <Dl> <Dd> (In some languages, only actual data types are allowed as values in the lookup table . In other languages, it is also possible to assign functions as lookup table values, gaining the same flexibility as a real switch statement . See Control table article for more detail on this). </Dd> <Dd> Lua does not support case / switch statements: http://lua-users.org/wiki/SwitchStatement . This lookup technique is one way to implement switch statements in the Lua language, which has no built - in switch . </Dd> <Dd> In some cases, lookup tables are more efficient than non-optimized switch statements since many languages can optimize table lookups, whereas switch statements are not optimized unless the range of values is small with few gaps . A non-optimized, non-binary search lookup, however, will almost certainly be slower than either a non-optimized switch or the equivalent multiple if - else statements . </Dd> </Dl> </Dd>

Which of the following is true for switch statement in c++