diff options
| author | Mattias Andrée <maandree@operamail.com> | 2014-01-23 13:30:57 +0100 |
|---|---|---|
| committer | Mattias Andrée <maandree@operamail.com> | 2014-01-23 13:30:57 +0100 |
| commit | ebbc4215ec39a8a6d0868a000e3c77cffd7c53d0 (patch) | |
| tree | 3b6383fd72b50919c8748580c97c55b756c631ff /src/datastructures/linkedlists/ArraySinglyLinkedList.java | |
| parent | code deduplication (diff) | |
| download | algorithms-and-data-structures-ebbc4215ec39a8a6d0868a000e3c77cffd7c53d0.tar.gz algorithms-and-data-structures-ebbc4215ec39a8a6d0868a000e3c77cffd7c53d0.tar.bz2 algorithms-and-data-structures-ebbc4215ec39a8a6d0868a000e3c77cffd7c53d0.tar.xz | |
doc
Signed-off-by: Mattias Andrée <maandree@operamail.com>
Diffstat (limited to '')
| -rw-r--r-- | src/datastructures/linkedlists/ArraySinglyLinkedList.java | 5 |
1 files changed, 4 insertions, 1 deletions
diff --git a/src/datastructures/linkedlists/ArraySinglyLinkedList.java b/src/datastructures/linkedlists/ArraySinglyLinkedList.java index e1421b7..7310695 100644 --- a/src/datastructures/linkedlists/ArraySinglyLinkedList.java +++ b/src/datastructures/linkedlists/ArraySinglyLinkedList.java @@ -22,7 +22,10 @@ package datastructures.linkedlists; * is a linked list constructed by parallel arrays. In * this implementation, when a node is removed the value * stored that that position is not removed before that - * position is reused. + * position is reused. Insertion methods have constant + * amortised time complexity, and constant amortised + * memory complexity, removal methods have constant time + * complexity and constant memory complexity. * * @param <T> The value stored in the structure */ |