Update ArrayList methods

nkatre · nkatre · commit 79c53c45b210 · 2015-02-01T14:52:47.000-05:00
diff --git a/ArrayList methods b/ArrayList methods
@@ -8,4 +8,3 @@ this copying of all the elements due to insufficient space causes (n) operation.
 the time complexity is O(n), but if this case is avoided then the time complexity is O(1), similar to array addition
 operation.
 All of the other operations run in linear time [i.e. O(n) time](roughly speaking).
-The constant factor is low compared to that for the LinkedList implementation.
