December 28, 2010
why does SList.insertFront have a complexity of O(log(n)) ?
December 28, 2010
Ellery Newcomer <ellery-newcomer@utulsa.edu> wrote:

> why does SList.insertFront have a complexity of O(log(n)) ?

Good question! It certainly is not the code's fault, as that's O(1) for
single elements and O(m) for ranges. File it to Bugzilly, I guess.

-- 
Simen