Realign a different indentation (#28409)

for the line of "Collections.sort(variable_nale);"

guide/english/java/arraylist/index.md

@@ -53,16 +53,19 @@ Since ArrayList implements *List*, an ArrayList can be created using the followi
   ```
 
 **Modify/update element at specified index**
+
   ```java
-   variable_name.set(index_number, element);
+  variable_name.set(index_number,element);
   ```
   
 **Get the size of the list**
+ 
  ```java
   variable_name.size();
   ```
   
 **Get a sublist of the list**
+ 
  ```java
   variable_name.subList(int fromIndex, int toIndex);
   ```
@@ -75,16 +78,16 @@ Since ArrayList implements *List*, an ArrayList can be created using the followi
   ```
   
 **Sort elements in ascending order**
-```java
+  ```java
   Collections.sort(variable_name);
   ```
   
 **Sort elements in descending order**
+
   ```java
   Collections.sort(variable_name, Collections.reverseOrder());
   ```
 
-
 **Creating Array from ArrayList**
 
    ```java
@@ -99,10 +102,9 @@ 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.
+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.
  
  ## Basic Big O for ArrayList Methods: