> For those who are bothered about the exponential algorithmic complexity of nub There is nothing exponential about nub. Given only equality comparisons, detec

> For those who are bothered about the exponential algorithmic complexity of nub There is nothing exponential about nub. Given only equality comparisons, detecting and eliminating duplicate elements requires quadratic running time.