doc

Signed-off-by: Mattias Andrée <maandree@operamail.com>

8 files changed, 38 insertions, 8 deletions

diff --git a/src/datastructures/linkedlists/ArrayCircularDoublyLinkedList.java b/src/datastructures/linkedlists/ArrayCircularDoublyLinkedList.java
index dc4453f..22cd43a 100644
--- a/src/datastructures/linkedlists/ArrayCircularDoublyLinkedList.java
+++ b/src/datastructures/linkedlists/ArrayCircularDoublyLinkedList.java
@@ -22,7 +22,11 @@ package datastructures.linkedlists;
  * linked list 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.
+ * removed before that 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
  */
diff --git a/src/datastructures/linkedlists/ArrayCircularSinglyLinkedList.java b/src/datastructures/linkedlists/ArrayCircularSinglyLinkedList.java
index 43c7737..db5d5b8 100644
--- a/src/datastructures/linkedlists/ArrayCircularSinglyLinkedList.java
+++ b/src/datastructures/linkedlists/ArrayCircularSinglyLinkedList.java
@@ -22,7 +22,11 @@ package datastructures.linkedlists;
  * linked list 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.
+ * removed before that 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
  */
diff --git a/src/datastructures/linkedlists/ArrayDoublyLinkedList.java b/src/datastructures/linkedlists/ArrayDoublyLinkedList.java
index df9fa40..a7fc1dd 100644
--- a/src/datastructures/linkedlists/ArrayDoublyLinkedList.java
+++ b/src/datastructures/linkedlists/ArrayDoublyLinkedList.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
  */
diff --git a/src/datastructures/linkedlists/ArraySentinelDoublyLinkedList.java b/src/datastructures/linkedlists/ArraySentinelDoublyLinkedList.java
index 33d127a..97437c9 100644
--- a/src/datastructures/linkedlists/ArraySentinelDoublyLinkedList.java
+++ b/src/datastructures/linkedlists/ArraySentinelDoublyLinkedList.java
@@ -25,7 +25,11 @@ package datastructures.linkedlists;
  * a sentinel (dummy) node between the first node and
  * the last node. In this implementation, when a node
  * is removed the value stored that that position is
- * not removed before that position is reused.
+ * not removed before that 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
  */
diff --git a/src/datastructures/linkedlists/ArraySentinelSinglyLinkedList.java b/src/datastructures/linkedlists/ArraySentinelSinglyLinkedList.java
index 4101183..2ca034d 100644
--- a/src/datastructures/linkedlists/ArraySentinelSinglyLinkedList.java
+++ b/src/datastructures/linkedlists/ArraySentinelSinglyLinkedList.java
@@ -25,7 +25,11 @@ package datastructures.linkedlists;
  * a sentinel (dummy) node between the first node and
  * the last node. In this implementation, when a node
  * is removed the value stored that that position is
- * not removed before that position is reused.
+ * not removed before that 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
  */
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
  */
diff --git a/src/datastructures/linkedlists/ArrayTaillessDoublyLinkedList.java b/src/datastructures/linkedlists/ArrayTaillessDoublyLinkedList.java
index d2c05d6..19cad2e 100644
--- a/src/datastructures/linkedlists/ArrayTaillessDoublyLinkedList.java
+++ b/src/datastructures/linkedlists/ArrayTaillessDoublyLinkedList.java
@@ -22,7 +22,11 @@ package datastructures.linkedlists;
  * linked list 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.
+ * removed before that 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
  */
diff --git a/src/datastructures/linkedlists/ArrayTaillessSinglyLinkedList.java b/src/datastructures/linkedlists/ArrayTaillessSinglyLinkedList.java
index 09de059..7e72881 100644
--- a/src/datastructures/linkedlists/ArrayTaillessSinglyLinkedList.java
+++ b/src/datastructures/linkedlists/ArrayTaillessSinglyLinkedList.java
@@ -22,7 +22,11 @@ package datastructures.linkedlists;
  * linked list 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.
+ * removed before that 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
  */