aboutsummaryrefslogtreecommitdiffstats
path: root/src/datastructures/linkedlists/ArraySinglyLinkedList.java
diff options
context:
space:
mode:
Diffstat (limited to 'src/datastructures/linkedlists/ArraySinglyLinkedList.java')
-rw-r--r--src/datastructures/linkedlists/ArraySinglyLinkedList.java5
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
*/