On Sat, May 3, 2014 at 9:13 PM, Steven D'Aprano wrote:
>
> On Sat, May 03, 2014 at 03:59:40PM -0700, Danny Yoo wrote:
> > Following up on this. Let's make sure that we're talking about the same
> > thing.
> >
> >
> > The assertion is that the following:
> >
> > fullPath += [...]
> >
> > wher
On Sat, May 03, 2014 at 03:59:40PM -0700, Danny Yoo wrote:
> Following up on this. Let's make sure that we're talking about the same
> thing.
>
>
> The assertion is that the following:
>
> fullPath += [...]
>
> where fullPath is a list of strings, exhibits O(n^2) time. I don't
> think th
Following up on this. Let's make sure that we're talking about the same thing.
The assertion is that the following:
fullPath += [...]
where fullPath is a list of strings, exhibits O(n^2) time. I don't
think this is true. Semantically, the statement above should be
equivalent to:
full
The the "Logical Error" question, this was brought up:
The big problem is this:
