Difference between revisions of "Template:List data structure comparison"
Jump to navigation
Jump to search
imported>Dcoetzee (Restoring red to inserting in middle of dynamic array - it's awful in theory and in practice for a large dynamic array.) |
imported>Angbor (insert/delete somewhere in middle of linked list is only O(1); additional time comes from indexing which is usually not necessary and listed separately) |
||
| Line 25: | Line 25: | ||
|- | |- | ||
|Insert/delete in middle | |Insert/delete in middle | ||
| − | |style="background:# | + | |style="background:#ddffdd"|Θ(1) |
|{{n/a}} | |{{n/a}} | ||
|style="background:#ffdddd"|Θ(''n'') | |style="background:#ffdddd"|Θ(''n'') | ||
Revision as of 13:15, 22 July 2012
| 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 | Θ(1) | N/A | Θ(1) amortized | Θ(log n) | Θ(log n) updating |
| Insert/delete in middle | Θ(1) | N/A | Θ(n) | Θ(log n) | Θ(log n) updating |
| Wasted space (average) | Θ(n) | 0 | Θ(n)[1] | Θ(n) | Θ(n) |
References
- ↑ 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 Check date values in:
|date=, |year= / |date= mismatch(help)