On Mon, Jun 15, 2009 at 12:38, Darin Adler <[email protected]> wrote: > > > Since DOMTokenList requires uniqueness, then I suspect it's still O(n log > n) even without sorting, not O(n).
That can be done in O(n). -- erik
On Mon, Jun 15, 2009 at 12:38, Darin Adler <[email protected]> wrote: > > > Since DOMTokenList requires uniqueness, then I suspect it's still O(n log > n) even without sorting, not O(n).
That can be done in O(n). -- erik