No no! I'm well aware that you are flattening the actual array only on demand.
And as I said thats not expensive for binary trees.
I'll qualify it as "half-lazy" if you want, b/c of the on-demand.
IMHO, real lazy means no big-copies at all... (see requirements)
Just imagine a non-binary tree like [[1..1e8]] then your algorithm would double the memory needed.
Cheers Rolf
( addicted to the Perl Programming Language)
PS: I wouldn't be surprized if your algorithm was faster than hdb's but with the advantage to be able to handle non-binary trees.
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
| |
For: |
|
Use: |
| & | | & |
| < | | < |
| > | | > |
| [ | | [ |
| ] | | ] |
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.