From 38d1618016c1c0bd3bc5e836d7665751d0fbfed5 Mon Sep 17 00:00:00 2001 From: Jason Date: Thu, 20 Dec 2018 19:09:11 -0700 Subject: [PATCH] Combined two sentences (#25706) --- guide/english/java/arraylist/index.md | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/guide/english/java/arraylist/index.md b/guide/english/java/arraylist/index.md index 7ee37c83d4..f49897064c 100644 --- a/guide/english/java/arraylist/index.md +++ b/guide/english/java/arraylist/index.md @@ -84,6 +84,7 @@ Since ArrayList implements *List*, an ArrayList can be created using the followi Collections.sort(variable_name, Collections.reverseOrder()); ``` + **Creating Array from ArrayList** ```java @@ -98,7 +99,8 @@ for(Object obj : arr) { } ``` - An ArrayList allows us to randomly access elements. ArrayList is similar to *Vector* in a lot of ways. But it is faster than Vectors. The main thing to note is that - Vectors are faster than arrays but ArrayLists are not. + An ArrayList allows us to randomly access elements. ArrayList is similar to *Vector* in a lot of ways, but it is faster than Vectors. The main thing to note is that - Vectors are faster than arrays but ArrayLists are not. + So when it comes down to choosing between the two - if speed is critical then Vectors should be considered, otherwise ArrayLists are better when it comes to storing large number of elements and accessing them efficiently.