Template:List data structure comparison: Difference between revisions

Content deleted Content added

Inline

Revision as of 05:10, 31 October 2011

	Linked list	Array	Dynamic array	Balanced tree	Random access list
Indexing	Θ(n)	Θ(1)	Θ(1)	Θ(log n)	Θ(log n)
Insert/delete at beginning	Θ(1)	—	Θ(n)	Θ(log n)	Θ(1)
Insert/delete at end	Θ(1)	—	Θ(1) amortized	Θ(log n)	Θ(log n) updating
Insert/delete in middle	search time + Θ(1)^[1]	—	Θ(n)	Θ(log n)	Θ(log n) updating
Wasted space (average)	Θ(n)	0	Θ(n)^[2]	Θ(n)	Θ(n)

^ Gerald Kruse. CS 240 Lecture Notes: Linked Lists Plus: Complexity Trade-offs. Juniata College. Spring 2008.
^ Brodnik, Andrej; Carlsson, Svante; Sedgewick, Robert; Munro, JI; Demaine, ED (Technical Report CS-99-09), Resizable Arrays in Optimal Time and Space (PDF), Department of Computer Science, University of Waterloo {{citation}}: Check date values in: |date= and |year= / |date= mismatch (help)

@@ Line 1: / Line 1: @@
 <div class=tright align=right>
 {|class="wikitable"
-!&nbsp;!![[Linked list]]!![[Array data structure|Array]]!![[Dynamic array|Dynamic<br />array]]!![[Self-balancing binary search tree|Balanced<br />tree]]!![[Random access<br /> list]]
+!&nbsp;!![[Linked list]]!![[Array data structure|Array]]!![[Dynamic array|Dynamic<br />array]]!![[Self-balancing binary search tree|Balanced<br />tree]]!![[Random access list|Random access<br />list]]
 |-
 |Indexing