http://www.perlmonks.org?node_id=574837


in reply to Linked lists as arrays: inserting values

Does your application actually require random-access insertion at any point in the array? If not, there are some optimization techniques you can try...

We're building the house of the future together.

Replies are listed 'Best First'.
Re^2: Linked lists as arrays: inserting values
by radiantmatrix (Parson) on Sep 25, 2006 at 22:58 UTC

      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.