Emergency pubmeet, Thursday 17th

[Greg McCarroll]

On 12 May 2007, at 18:01, Peter Corlett wrote:

>
> What, no backtracking to a previous pub if we drink our way half  
> way across the bar and then find there's no match?
>

i'm wondering if we could construct a sufficiently interesting pub  
matching problem
that we could, like the sort dances of yesteryear, demonstrate the  
behavior of Perl's
regex engine via a pub crawl?

a bubble-sort pub crawl where you start with the order of the pubs in  
the street, and
for your compare operation go into a pair and order even just a half  
pint of their
recommended bitter in each and swap as appropriate is too scary to  
even contemplate
for more than 4 pubs. i also expect the staff would be even more  
scared, doubly so if
there was a timetable for different teams to sync their ops and  
different teams
where sorting on different beverages.

G.