Efficiency comparison with other data structures Linked list Array - TopicsExpress



          

Efficiency comparison with other data structures Linked list Array Dynamic array Balanced tree Random access list Indexing Θ(n) Θ(1) Θ(1) Θ(log n) Θ(log n) Insert/ delete at beginning Θ(1) N/A Θ(n) Θ(log n) Θ(1) Insert/ delete at end Θ(n) last element is unknown Θ(1) last element is known N/A Θ(1) amortized Θ(log n) Θ(log n) updating Insert/ delete in middle search time + Θ(1)[9] [10][11] N/A Θ(n) Θ(log n) Θ(log n) updating Wasted space (average) Θ(n) 0 Θ(n)[12] Θ(n) Θ(n)
Posted on: Fri, 26 Jul 2013 09:51:02 +0000

Trending Topics



Recently Viewed Topics




© 2015