Refactor the project CodeNerve#71

All algorithms implementations moved to new module 'Algorithms'. All games implementations modules moved to module new 'Games'.
Small naming refactoring so maven doesn't yell at me.

Author: Chris

AddFibonacciNumbers/pom.xml

@@ -9,7 +9,7 @@
     </parent>
     <modelVersion>4.0.0</modelVersion>
 
-    <artifactId>BubbleSort</artifactId>
+    <artifactId>Algorithms</artifactId>
 
 
 </project>

BubbleSort/pom.xml Algorithms/pom.xmlBubbleSort/pom.xml renamed to Algorithms/pom.xml

@@ -1,3 +1,6 @@
+/**
+ * Example code of binary search
+ */
 public class BinarySearch {
 
     public static void main(String[] args) {

…rySearch/src/main/java/BinarySearch.java …gorithms/src/main/java/BinarySearch.javaBinarySearch/src/main/java/BinarySearch.java renamed to Algorithms/src/main/java/BinarySearch.java BinarySearch/src/main/java/BinarySearch.java renamed to Algorithms/src/main/java/BinarySearch.java

@@ -1,4 +1,6 @@
-
+/**
+ * Code for finding minimum in rotated sorted array using binary search
+ */
 public class FindMinimumInRotatedSortedArray {
 
     public int findMin(int[] nums) {

…ance/src/main/java/EuclieanDistance.java …thms/src/main/java/EuclieanDistance.javaEuclieanDistance/src/main/java/EuclieanDistance.java renamed to Algorithms/src/main/java/EuclieanDistance.java EuclieanDistance/src/main/java/EuclieanDistance.java renamed to Algorithms/src/main/java/EuclieanDistance.java

@@ -1,3 +1,5 @@
+package dynamic_programing;
+
 class Solution {
 
     public int fib(int n) {

…ava/FindMinimumInRotatedSortedArray.java …ava/FindMinimumInRotatedSortedArray.javaFindMinimumInRotatedSortedArray/src/main/java/FindMinimumInRotatedSortedArray.java renamed to Algorithms/src/main/java/FindMinimumInRotatedSortedArray.java FindMinimumInRotatedSortedArray/src/main/java/FindMinimumInRotatedSortedArray.java renamed to Algorithms/src/main/java/FindMinimumInRotatedSortedArray.java

@@ -1,3 +1,4 @@
+package dynamic_programing;
 
 import java.util.Arrays;
 

…mming/src/main/java/FibonacciNumber.java …/dynamic_programing/FibonacciNumber.javaDynamicProgramming/src/main/java/FibonacciNumber.java renamed to Algorithms/src/main/java/dynamic_programing/FibonacciNumber.java DynamicProgramming/src/main/java/FibonacciNumber.java renamed to Algorithms/src/main/java/dynamic_programing/FibonacciNumber.java

@@ -1,5 +1,7 @@
+package encryption;
+
 import java.util.*;
-public class S_Des{
+public class SimpleDESEncryptionAlgorithm {
 	String[] keyGeneration(String key0,int[] p10,int[] p8){
 		StringBuilder Key1 = new StringBuilder(key0);
 		for(int i = 0;i<p10.length;i++){
@@ -178,7 +180,7 @@ public static void main(String[] args) {
 	String key = s.nextLine();
 	int pTen[] = {3,5,2,7,4,10,1,9,8,6};
 	int pEight[] = {6,3,7,4,8,5,10,9};
-	S_Des cipher= new S_Des();
+	SimpleDESEncryptionAlgorithm cipher= new SimpleDESEncryptionAlgorithm();
 	String keys[] = cipher.keyGeneration(key,pTen,pEight);
 
 	System.out.println("Key1 is:- "+keys[0]+"\n"+"Key2 is:- "+keys[1]);

…ogramming/src/main/java/HouseRobber.java …java/dynamic_programing/HouseRobber.javaDynamicProgramming/src/main/java/HouseRobber.java renamed to Algorithms/src/main/java/dynamic_programing/HouseRobber.java DynamicProgramming/src/main/java/HouseRobber.java renamed to Algorithms/src/main/java/dynamic_programing/HouseRobber.java

@@ -1,3 +1,5 @@
+package matrix_operation;
+
 import java.util.Arrays;
 import java.util.Random;
 
@@ -83,7 +85,7 @@ public static double[][] elementMatrixMultiplication(double[][] A, double b) {
     public static double[][] matrixAddition(double[][] A, double[][] B) {
 
         if (A.length != B.length || A[0].length != B[0].length) {
-            System.out.println("Matrix A and Matrix B must have equal dimensions.\n Returing matrix A.");
+            System.out.println("matrix_operation.Matrix A and matrix_operation.Matrix B must have equal dimensions.\n Returing matrix A.");
             return(A);
         }
 
@@ -102,7 +104,7 @@ public static double[][] matrixAddition(double[][] A, double[][] B) {
     public static double[][] matrixMultiplication(double[][] A, double[][] B) {
 
         if (A[0].length != B.length) {
-            System.out.println("Matrix A number of rows must be equal to Matrix B number of columns.\nReturning matrix A");
+            System.out.println("matrix_operation.Matrix A number of rows must be equal to matrix_operation.Matrix B number of columns.\nReturning matrix A");
             return(A);
         }
 
@@ -125,19 +127,19 @@ public static double[][] matrixMultiplication(double[][] A, double[][] B) {
     public static void main(String[] args) {
 
         double[][] I = identityMatrix(4);
-        System.out.println("\nIdentity Matrix 4x4: "+Arrays.deepToString(I));
+        System.out.println("\nIdentity matrix_operation.Matrix 4x4: "+Arrays.deepToString(I));
 
         double[][] A = randomMatrix(4, 4, -5, 5);
-        System.out.println("\nRandom Matrix A: "+Arrays.deepToString(A));
+        System.out.println("\nRandom matrix_operation.Matrix A: "+Arrays.deepToString(A));
 
         A = elementMatrixMultiplication(A, 2);
-        System.out.println("\nMatrix A multiplied by 2: "+Arrays.deepToString(A));
+        System.out.println("\nmatrix_operation.Matrix A multiplied by 2: "+Arrays.deepToString(A));
 
         double[][] A_T = transposeMatrix(A);
-        System.out.println("\nMatrix A Transpose: "+Arrays.deepToString(A_T));
+        System.out.println("\nmatrix_operation.Matrix A Transpose: "+Arrays.deepToString(A_T));
 
         double[][] B = randomMatrix(4, 4, -5, 5);
-        System.out.println("\nRandom Matrix B: "+Arrays.deepToString(B));
+        System.out.println("\nRandom matrix_operation.Matrix B: "+Arrays.deepToString(B));
 
         double[][] C = matrixAddition(A, B);
         System.out.println("\nA + B: "+Arrays.deepToString(C));