Says indigo:
Sort takes O(n log n). Simply walking the keys of the hash is only O(n).
A lot of people made this point, but I wonder if it's really as important as
people think. sort() is written in C and is very fast.
Walking the keys requires that a lot of Perl opcodes must be dispatched,
so it is probably a lot slower. Yes, the times are O(n log n)
and O(n), but that ignores the constant factors, and I would expect
the constant factor for the sort to be much smaller, so that the sort
would be faster except for extremely large hashes.
Maybe someone who likes benchmarking can look into this and
post the results.
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|
