3) Recursion Represent universe by widget of size u R cursive ely split each widget w oI SIze into W subwidgets sub[ W/[o], sub[w[1] sub[WILW-1] each of size Store a summary widget summary[W] of size w representing which subwidgets are nonempty W b.1 c 2001 by erik D. Demaine Introduction to Algorithms Day23L12.12© 2001 by Erik D. Demaine Introduction to Algorithms Day 23 L12.12 (3) Recursion Represent universe by widget of size u. Recursively split each widget W of size |W| into sub[W][ W subwidgets sub[W][0], sub[W][1], …, W summary[W] W sub[W][0] W sub[W][1] W sub[W][ ] W … W −1 Store a summary widget summary[W] of size representing which subwidgets are nonempty. W W −1 ] each of size W