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.

BubbleSort/pom.xml → Algorithms/pom.xml

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

BinarySearch/src/main/java/BinarySearch.java → Algorithms/src/main/java/BinarySearch.java

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

FindMinimumInRotatedSortedArray/src/main/java/FindMinimumInRotatedSortedArray.java → Algorithms/src/main/java/FindMinimumInRotatedSortedArray.java

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

DynamicProgramming/src/main/java/FibonacciNumber.java → Algorithms/src/main/java/dynamic_programing/FibonacciNumber.java

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

DynamicProgramming/src/main/java/HouseRobber.java → Algorithms/src/main/java/dynamic_programing/HouseRobber.java

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

SimpleDESEncryptionAlgorithm/src/main/java/S_Des.java → Algorithms/src/main/java/encryption/SimpleDESEncryptionAlgorithm.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]);

MatrixOperations/src/main/java/Matrix.java → Algorithms/src/main/java/matrix_operation/Matrix.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));

ArmstrongNumber/src/main/java/ArmstrongNum.java → Algorithms/src/main/java/numbers/ArmstrongNum.java

@@ -1,3 +1,5 @@
+package numbers;
+
 import java.util.Scanner;
 
 public class ArmstrongNum {

CalculatePi/src/main/java/CalculatePi.java → Algorithms/src/main/java/numbers/CalculatePi.java

@@ -1,5 +1,10 @@
+package numbers;
+
 import java.util.Scanner;
 
+/**
+ * Calculate Pi using infinite series
+ */
 public class CalculatePi {
 
     Scanner s = new Scanner(System.in);

LCM/src/main/java/LCM.java → Algorithms/src/main/java/numbers/LCM.java

@@ -1,3 +1,5 @@
+package numbers;
+
 import java.util.Scanner;
 
 class LCM {
@@ -9,7 +11,7 @@ public static void main(String arg[]) {
         System.out.println("enter  number 2");
         b = sc.nextLong();
         lcm = lcmCalculation(a, b);
-        System.out.println("LCM of " + a + " and " + b + " is =" + lcm);
+        System.out.println("numbers.LCM of " + a + " and " + b + " is =" + lcm);
     }
     static long lcmCalculation(long n1, long n2) {
         long temp, i = 2, res;

NumberSquare/src/main/java/NumberSquare.java → Algorithms/src/main/java/numbers/NumberSquare.java

@@ -1,4 +1,4 @@
-/*
+package numbers;/*
  * To change this license header, choose License Headers in Project Properties.
  * To change this template file, choose Tools | Templates
  * and open the template in the editor.

PalindromeChecking/src/main/java/Palindrome.java → Algorithms/src/main/java/numbers/PalindromeNumber.java

@@ -1,5 +1,7 @@
+package numbers;
+
 import java.io.*;
-public class Palindrome{
+public class PalindromeNumber {
 	public static void main(String[] args) throws Exception {
 		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
 		System.out.println("Enter the number :");

AddFibonacciNumbers/src/main/java/BruteForce.java → Algorithms/src/main/java/numbers/add_fibonacci_numbers/BruteForce.java

@@ -1,3 +1,5 @@
+package numbers.add_fibonacci_numbers;
+
 import java.io.*;
 
 public class BruteForce { 

AddFibonacciNumbers/src/main/java/DPEfficient.java → Algorithms/src/main/java/numbers/add_fibonacci_numbers/DPEfficient.java

@@ -1,3 +1,5 @@
+package numbers.add_fibonacci_numbers;
+
 import java.util.HashMap;
 import java.util.Map;
 

AddFibonacciNumbers/src/main/java/Efficient.java → Algorithms/src/main/java/numbers/add_fibonacci_numbers/Efficient.java

@@ -1,3 +1,5 @@
+package numbers.add_fibonacci_numbers;
+
 import java.io.*;
 import java.util.*;
 

FindPrime/src/main/java/FindPrime.java → Algorithms/src/main/java/numbers/find_prime/FindPrime.java

@@ -1,3 +1,5 @@
+package numbers.find_prime;
+
 public class FindPrime{
     public static void main(String[] args) {
         int num = 0;

FindPrime/src/main/java/Solution.java → Algorithms/src/main/java/numbers/find_prime/Solution.java

@@ -1,3 +1,5 @@
+package numbers.find_prime;
+
 import java.io.*;
 import java.math.*;
 import java.security.*;

BubbleSort/src/main/java/BubbleSort.java → Algorithms/src/main/java/sorting/BubbleSort.java

@@ -1,3 +1,5 @@
+package sorting;
+
 import java.util.Arrays;
 import java.util.Scanner;
 

SortingAlgorithms/src/main/java/BubbleSort.java → Algorithms/src/main/java/sorting/BubbleSort2.java

@@ -1,7 +1,9 @@
+package sorting;
+
 /* Bubblesort algorithm in Java
 @Author: Rasmus Knoth Nielsen
  */
-public class BubbleSort
+public class BubbleSort2
 {
     // Method that implements the bubblesort algorithm
     void bubbleSort(int arr[])
@@ -30,7 +32,7 @@ void printArray(int arr[])
     // Main method to test if the bubblesort works as intended.
     public static void main(String args[])
     {
-        BubbleSort sort = new BubbleSort();
+        BubbleSort2 sort = new BubbleSort2();
         int arr[] = {35, 13, 76, 9, 58, 39, 20, 1, 80, 55, 5};
         System.out.println("Array before being sorted:");
         sort.printArray(arr);

HeapSort/src/main/java/HeapSort.java → Algorithms/src/main/java/sorting/HeapSort.java

@@ -1,3 +1,5 @@
+package sorting;
+
 import java.util.Scanner;
 
 public class HeapSort{

SortingAlgorithms/src/main/java/MergeSort.java → Algorithms/src/main/java/sorting/MergeSort.java

@@ -1,3 +1,5 @@
+package sorting;
+
 class MergeSort {
 	private void merge(int arr[], int l, int m, int r) {
 		int n1 = m - l + 1;

SelectionSort/src/main/java/Main.java → Algorithms/src/main/java/sorting/SelectionSort.java

@@ -1,6 +1,8 @@
-import java.util.Scanner;  
+package sorting;
+
+import java.util.Scanner;
 
-public class Main
+public class SelectionSort
 {  
    public static void main(String args[])  
    {  

LongestPalindromicSubString/src/main/java/LongestPalindromicSubString.java → Algorithms/src/main/java/strings/LongestPalindromicSubString.java

@@ -1,3 +1,5 @@
+package strings;
+
 import java.util.Scanner;
 
 class longestPalindromicSubString {

Pangram/src/main/java/Pangram.java → Algorithms/src/main/java/strings/Pangram.java

@@ -1,3 +1,5 @@
+package strings;
+
 import java.util.ArrayList;
 import java.util.Arrays;
 import java.util.Collections;

PermutationOfString/src/main/java/PermutationOfString.java → Algorithms/src/main/java/strings/PermutationOfString.java

@@ -1,3 +1,4 @@
+package strings;
 
 public class PermutationOfString {
 

BinaryTrees/src/main/java/MirrorTree.java → Algorithms/src/main/java/trees/MirrorBinaryTree.java

@@ -1,5 +1,7 @@
+package trees;
+
 import java.util.*;
-public class MirrorTree{
+public class MirrorBinaryTree {
 static class Node{
 	int data;
 	Node left;Node right;

SegmentTrees/src/main/java/SegmentTrees.java → Algorithms/src/main/java/trees/SegmentTrees.java

@@ -1,4 +1,6 @@
-class NumArray 
+package trees;
+
+class NumArray
 {
     int[] tree;
     int n;

Tree/src/main/java/Node.java → Algorithms/src/main/java/trees/tree/Node.java

@@ -1,4 +1,4 @@
-package Tree;
+package trees.tree;
 public class Node {
 
 

Tree/src/main/java/Tree.java → Algorithms/src/main/java/trees/tree/Tree.java

@@ -1,4 +1,4 @@
-package Tree;
+package trees.tree;
 public class Tree extends Node {
 
 	public Tree(int data) {

Tree/src/main/java/Tree_Set.java → Algorithms/src/main/java/trees/tree/Tree_Set.java

@@ -1,4 +1,4 @@
-package Tree;
+package trees.tree;
 // Java program to demonstrate insertions in TreeSet 
 import java.util.*; 
 

Tree/src/main/java/com/let/us/java/tree/avltree/Linkedlist.java → Algorithms/src/main/java/trees/tree/tree/avltree/Linkedlist.java

@@ -1,4 +1,4 @@
-package com.let.us.java.tree.avltree;
+package trees.tree.tree.avltree;
 
 import java.util.Scanner;
 

Tree/src/main/java/com/let/us/java/tree/binarytree/BinarySearchTree.java → Algorithms/src/main/java/trees/tree/tree/binarytree/BinarySearchTree.java

@@ -1,4 +1,4 @@
-package com.let.us.java.tree.binarytree;
+package trees.tree.tree.binarytree;
 
 import java.util.Scanner;