Updated Insertion Sort

Author: Vishal023

Implementation/InsertionSort.java

@@ -3,6 +3,11 @@
 import java.util.Arrays;
 
 /**
+ * Best performance when size of array is small
+ * Stable Sorting
+ * Best Case -  Array Sorted -
+ * Worst Case - Reverse Sorted - O(N^2)
+ *
  * @author Vishal Singh */
 public class InsertionSort {
     static void insertionSort(int[] arr,int n){
@@ -17,12 +22,6 @@ static void insertionSort(int[] arr,int n){
         }
     }
     public static void main(String[] args) {
-        //Best performance when size of array is small
-        /*
-         * Stable Sorting
-         *  Best Case -  Array Sorted -
-         * Worst Case - Reverse Sorted - O(N^2)
-         * */
         int[] arr = {50,20,40,10,30,60,80,99};
         insertionSort(arr,arr.length);
         System.out.println(Arrays.toString(arr));