Comparing strings from the back?

Dave Angel d at davea.name
Thu Sep 6 10:23:45 EDT 2012


On 09/06/2012 09:43 AM, Johannes Bauer wrote:
> <snip>
> Yes, worst-case is O(N), best case O(1). Average is O(n log n).

Can't see how you came up with an average of n log(n).  Fourteen minutes
before you made this post, you demonstrated it was less than 2 for any N.

And I previously posted that for a character set of size 10, the average
was 1.1111



-- 

DaveA




More information about the Python-list mailing list