Lawrence Kirby wrote: > On Tue, 10 May 2005 04:58:48 -0700, alex goldman wrote: > >> Sean Burke wrote: > > ... > >>> No, you're just confused about the optimization metric. >>> In regexes, "greedy" match optimizes for the longest match, >>> not the fastest. >>> >>> And this is common regex terminology - man perlre and you will >>> find discussion of "greedy" vs. "stingy" matching. >> >> Read what you quoted again. Everyone (Xah, vermicule, myself) was talking >> about "greedy" as it's used in graph search and optimization algorithms. > > However the original quote was in the context of regular expressions, so > discussion of the terminology used in regular expressions is far more > relevant than the terminology used in graph search and optimisation > algorithms.
I replied to "And from memory, that is the sort of thing done in Computing 101 and in Data Structures and Algorithms 101", and I fully explained what I meant by "greedy" as well. There was no ambiguity. -- http://mail.python.org/mailman/listinfo/python-list
