Timeline for answer to Finding all combinations of well-formed brackets by kvb
Current License: CC BY-SA 2.5
Post Revisions
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 8, 2009 at 6:28 | comment | added | kvb | On my machine, a memoized version of this code (slightly modified to replace the sprintf with concatenation) runs in ~.6s for N=12, whereas your code runs in ~.2s. The difference gets worse as you go up from there, though. Some of this is due to string concatenation, which you nicely avoid. | |
| Apr 8, 2009 at 5:58 | comment | added | Brian | Elegant! It may be fun to memoize and then compare the perf for N=12 or so. | |
| Apr 8, 2009 at 3:26 | history | answered | kvb | CC BY-SA 2.5 |