An O(n2) algorithm for splitting a case statement's jump table into the minimum number of subtables (of a given density) is presented. Previously, the problem was thought to be NP‐complete.
|Original language||English (US)|
|Number of pages||1|
|Journal||Software: Practice and Experience|
|State||Published - Feb 1994|
- Case statement
- Code generation
ASJC Scopus subject areas