Premium
Correction to ‘producing good code for the case statement’
Author(s) -
Kannan Sampath,
Proebsting Todd A.
Publication year - 1994
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380240206
Subject(s) - statement (logic) , code (set theory) , table (database) , jump , computer science , algorithm , arithmetic , mathematical economics , information retrieval , programming language , mathematics , data mining , epistemology , philosophy , physics , set (abstract data type) , quantum mechanics
An O(n 2 ) 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.