with a binary tree, you get O(log n) instead of O(1) for each operation
Well, only if the binary tree is balanced (and ordered).
I am very well aware of the performance levels of a binary
tree - if I wanted to settle for O (log n) performance,
I wouldn't have posted the challenge. The challenge is to
do all operations in O (1) - doing one or more in O (log n)
is not a challenge.
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.
While some C libraries might initialize the memory claimed
with mmap or brk, there's no reason they have to. The OS and/or the C libraries can always be patched that one can
claim a segment of memory, and taking it "as is". For the
scope of the challenge, you may assume that we run on a platform where memory is given out "as is".
Abigail
-
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.
|