This is an interesting question.
If I read you correctly, it is like this:
you could get an only slightly slower solution
by using a hash, or better, a binary tree instead
of the uninitialized array A
(with a binary tree, you get O(log n) instead of O(1) for each operation).
In fact,
this is true no matter how you use an uninitialized array,
that is, you can always use a hash or a binary tree instead
of one.
Notice however, that if you use such a data structure only once,
and you use the efficent C implementation,
the OS still has to initialize the array when the process
gets the memory by calling brk or mmap.
-
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.
|
