fixed formatting issues

Author: BamaCharanChhandogi

src/main/java/com/thealgorithms/misc/Sort012D.java

@@ -3,16 +3,16 @@
 import java.util.Scanner;
 
 /**
- * The array is divided into four sections: 
- * a[1..Lo-1] zeroes 
- * a[Lo..Mid-1] ones 
- * a[Mid..Hi] unknown 
- * a[Hi+1..N] twos 
- * 
+ * The array is divided into four sections:
+ * a[1..Lo-1] zeroes
+ * a[Lo..Mid-1] ones
+ * a[Mid..Hi] unknown
+ * a[Hi+1..N] twos
+ *
  * If array [mid] = 0, then swap array [mid] with array [low] and increment both pointers once.
  * If array [mid] = 1, then no swapping is required. Increment mid pointer once.
  * If array [mid] = 2, then we swap array [mid] with array [high] and decrement the high pointer once.
- * 
+ *
  * For more information on the Dutch national flag algorithm refer
  * https://en.wikipedia.org/wiki/Dutch_national_flag_problem
  */