public class InsertionSort {
    public static int[] sort(int[] array) {
        for (int i = 1; i < array.length; i++) {
            int item = array[i];
            int indexHole = i;
            while (indexHole > 0 && array[indexHole - 1] > item) {
                array[indexHole] = array[--indexHole];
            }
            array[indexHole] = item;
        }
        return array;
    }
}

@@ -40,21 +40,20 @@
  static 
-int%5B%5D
+void
  sort(in
@@ -365,30 +365,8 @@
   %7D%0A
-        return array;%0A
     

Fix return type of insertion sort