Stephen wrote: >On Tue, 9 Jul 2002, Chris Dolan wrote: > >> My favorite solution was by Jukka Suomela at 97.47. [...] >> >> The principle behind this solution is that Perl already has a >> topological sorter for graphs built in: the garbage collector. >> [...] >> > >That is truly brilliant. And all in under 100 characters. Do the judges >still award discretionary prizes? Yes, they do. It's up to them, though I'd guess that community pressure may have an impact on their decision. Ton and Wladimir's prizes have already been shipped, but O'Reilly and ActiveState can certainly afford one more! Rick, let me know if you deem Jukka's solution worthy of official recognition. --DaveThread Previous | Thread Next