• Ellery Newcomer (1/1) Dec 28 2010 why does SList.insertFront have a complexity of O(log(n)) ?
• Simen kjaeraas (5/6) Dec 28 2010 Good question! It certainly is not the code's fault, as that's O(1) for

Ellery Newcomer <ellery-newcomer utulsa.edu> writes:

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

"Simen kjaeraas" <simen.kjaras gmail.com> writes:

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