Added 13 solutions

Algorithms/Sorting/Running Time of Algorithms/Solution.java

@@ -0,0 +1,33 @@
+//     Author: Rodney Shaghoulian
+//     Github: github.com/rshaghoulian
+// HackerRank: hackerrank.com/rshaghoulian
+
+import java.util.Scanner;
+
+public class Solution {
+
+    public static void insertionSortShiftCounter(int[] array) {
+        int shifts = 0;
+        for (int i = 1; i < array.length; i++) {
+            int j = i;
+            int value = array[i];
+            while (j >= 1 && array[j-1] > value) { // find where to insert "value"
+                array[j] = array[j-1];             // shift elements (1 by 1) to make room for inserting
+                j--;
+                shifts++;
+            }
+            array[j] = value;
+        }
+        System.out.println(shifts);
+    }
+    
+    public static void main(String[] args) {
+        Scanner scan = new Scanner(System.in);
+        int s = scan.nextInt();
+        int[] array = new int[s];
+        for (int i = 0; i < s; i++) {
+            array[i] = scan.nextInt(); 
+        }
+        insertionSortShiftCounter(array);
+    }
+}