Link Details

Link 1055371 thumbnail
User 454796 avatar

By Andrey_Karpov_2009
via gokcehan.github.io
Submitted: Oct 25 2013 / 08:21

This post introduces implementations of queue and deque data structures using dynamic arrays. Deque implementation is suitable as a default container to replace standard dynamic arrays as it has the advantage of having constant time complexity for front push/pop operations with little or no speed/locality overhead. This may especially be a game changer for dynamic languages such as python or ruby where people care less about the complexity and use lists/arrays for anything required.
  • 2
  • 0
  • 153
  • 29

Add your comment


Html tags not supported. Reply is editable for 5 minutes. Use [code lang="java|ruby|sql|css|xml"][/code] to post code snippets.

Voters For This Link (2)



Voters Against This Link (0)



    Java Performance Optimization
    Written by: Pierre-Hugues Charbonneau
    Featured Refcardz: Top Refcardz:
    1. Design Patterns
    2. OO JS
    3. Cont. Delivery
    4. Java EE7
    5. HTML5 Mobile
    1. Node.js
    2. Debugging JavaScript
    3. OO JS
    4. JSON
    5. Ajax