Beefy Boxes and Bandwidth Generously Provided by pair Networks
XP is just a number

Re^3: Linked lists as arrays: inserting values

by jdporter (Canon)
on Sep 26, 2006 at 01:44 UTC ( #574851=note: print w/ replies, xml ) Need Help??

in reply to Re^2: Linked lists as arrays: inserting values
in thread Linked lists as arrays: inserting values

I should have said heuristics, rather than optimizations. For example, if the point of the next insertion is usually "very close" to the previous insertion, you can make a significant improvement in the performance (e.g. O(n) vs O(n log n)). At any rate, choosing a O(n) algorithm up front instead of a O(n log n) algorithm shouldn't be dismissed as "premature". It could be, in fact, a well-timed optimization of your development process. :-)

We're building the house of the future together.

Comment on Re^3: Linked lists as arrays: inserting values

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://574851]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (3)
As of 2015-11-28 07:00 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (739 votes), past polls