shadow/shadow — Issue #30: Use binary search tree for more efficient CDF lookups
Author: robgjansen
Created: 2011-10-13 16:14:46+00:00
State: open
Labels: feature

CDFs use a list to store the values. This means lookups are O(n). If we use a BST, we can achieve O(log(n)).