bchop
Utility - Binary Decomposition
AKA
``interval halving''
Each object file = endpoint in binary tree
O
(log(
N
)) to traverse tree
Order object files
Select according to LSBs
Take subset from ``
bad
''
Take remainder from ``
good
''
Slide 5
