Method insertionSort

Programs/InsertionSort.java:12–23

(int[] arr)

    }
   //Insertion Sort Algorithm
    static void insertionSort(int[] arr) {
        for (int i = 0; i < arr.length - 1; i++) {
            for (int j = i+1; j > 0; j--) {
                if (arr[j] < arr[j-1]) {
                    swap(arr, j, j-1);
                } 
              else {
                    break;
                }
            }
        }
    }
  //Swapping Algorithm
  static void swap(int[] arr, int first, int second) {
        int temp = arr[first];