Problem 066 Running Time Of Algorithm :: Calculating the number of ReAsign Operands inside Sorting by Insertion Algorithm

Author: jeanbou

HackerRank/Java/Problem_Solving/Problem066_RunningTimeOfAlgorithm__CountTheNumberOfReAssigning.java

@@ -0,0 +1,53 @@
+package hackerRank_JavaProblemSolving;
+
+import java.io.BufferedWriter;
+import java.io.FileWriter;
+import java.io.IOException;
+import java.util.Scanner;
+
+public class Problem066_RunningTimeOfAlgorithm__CountTheNumberOfReAssigning {
+
+// HINTS: Analyzing the requirement, I came to conclusion that I need to calculate the reassigning number of operation
+ static int runningTime(int[] A) {
+ int count = 0; 
+ for(int i = 1; i < A.length; i++) {
+ int value = A[i];
+ int j = i - 1;
+ while(j >= 0 && A[j] > value) {
+ A[j + 1] = A[j];
+ j--;
+ count++;
+ }
+ A[j + 1] = value; 
+ }
+ return count;
+ }
+
+ private static final Scanner scanner = new Scanner(System.in);
+
+ public static void main(String[] args) throws IOException {
+ BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
+
+ int n = scanner.nextInt();
+ scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
+
+ int[] arr = new int[n];
+
+ String[] arrItems = scanner.nextLine().split(" ");
+ scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
+
+ for (int i = 0; i < n; i++) {
+ int arrItem = Integer.parseInt(arrItems[i]);
+ arr[i] = arrItem;
+ }
+
+ int result = runningTime(arr);
+
+ bufferedWriter.write(String.valueOf(result));
+ bufferedWriter.newLine();
+
+ bufferedWriter.close();
+
+ scanner.close();
+ }
+}