Skip to content

Commit 09eed19

Browse files
ChrisChris
authored andcommitted
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.
1 parent 056d1fb commit 09eed19

File tree

83 files changed

+91
-412
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

83 files changed

+91
-412
lines changed

AddFibonacciNumbers/pom.xml

Lines changed: 0 additions & 19 deletions
This file was deleted.

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,7 @@
99
</parent>
1010
<modelVersion>4.0.0</modelVersion>
1111

12-
<artifactId>BubbleSort</artifactId>
12+
<artifactId>Algorithms</artifactId>
1313

1414

1515
</project>

BinarySearch/src/main/java/BinarySearch.java renamed to Algorithms/src/main/java/BinarySearch.java

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,6 @@
1+
/**
2+
* Example code of binary search
3+
*/
14
public class BinarySearch {
25

36
public static void main(String[] args) {
Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,6 @@
1-
1+
/**
2+
* Code for finding minimum in rotated sorted array using binary search
3+
*/
24
public class FindMinimumInRotatedSortedArray {
35

46
public int findMin(int[] nums) {

DynamicProgramming/src/main/java/FibonacciNumber.java renamed to Algorithms/src/main/java/dynamic_programing/FibonacciNumber.java

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,5 @@
1+
package dynamic_programing;
2+
13
class Solution {
24

35
public int fib(int n) {

DynamicProgramming/src/main/java/HouseRobber.java renamed to Algorithms/src/main/java/dynamic_programing/HouseRobber.java

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,4 @@
1+
package dynamic_programing;
12

23
import java.util.Arrays;
34

SimpleDESEncryptionAlgorithm/src/main/java/S_Des.java renamed to Algorithms/src/main/java/encryption/SimpleDESEncryptionAlgorithm.java

Lines changed: 4 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,7 @@
1+
package encryption;
2+
13
import java.util.*;
2-
public class S_Des{
4+
public class SimpleDESEncryptionAlgorithm {
35
String[] keyGeneration(String key0,int[] p10,int[] p8){
46
StringBuilder Key1 = new StringBuilder(key0);
57
for(int i = 0;i<p10.length;i++){
@@ -178,7 +180,7 @@ public static void main(String[] args) {
178180
String key = s.nextLine();
179181
int pTen[] = {3,5,2,7,4,10,1,9,8,6};
180182
int pEight[] = {6,3,7,4,8,5,10,9};
181-
S_Des cipher= new S_Des();
183+
SimpleDESEncryptionAlgorithm cipher= new SimpleDESEncryptionAlgorithm();
182184
String keys[] = cipher.keyGeneration(key,pTen,pEight);
183185

184186
System.out.println("Key1 is:- "+keys[0]+"\n"+"Key2 is:- "+keys[1]);

MatrixOperations/src/main/java/Matrix.java renamed to Algorithms/src/main/java/matrix_operation/Matrix.java

Lines changed: 9 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,5 @@
1+
package matrix_operation;
2+
13
import java.util.Arrays;
24
import java.util.Random;
35

@@ -83,7 +85,7 @@ public static double[][] elementMatrixMultiplication(double[][] A, double b) {
8385
public static double[][] matrixAddition(double[][] A, double[][] B) {
8486

8587
if (A.length != B.length || A[0].length != B[0].length) {
86-
System.out.println("Matrix A and Matrix B must have equal dimensions.\n Returing matrix A.");
88+
System.out.println("matrix_operation.Matrix A and matrix_operation.Matrix B must have equal dimensions.\n Returing matrix A.");
8789
return(A);
8890
}
8991

@@ -102,7 +104,7 @@ public static double[][] matrixAddition(double[][] A, double[][] B) {
102104
public static double[][] matrixMultiplication(double[][] A, double[][] B) {
103105

104106
if (A[0].length != B.length) {
105-
System.out.println("Matrix A number of rows must be equal to Matrix B number of columns.\nReturning matrix A");
107+
System.out.println("matrix_operation.Matrix A number of rows must be equal to matrix_operation.Matrix B number of columns.\nReturning matrix A");
106108
return(A);
107109
}
108110

@@ -125,19 +127,19 @@ public static double[][] matrixMultiplication(double[][] A, double[][] B) {
125127
public static void main(String[] args) {
126128

127129
double[][] I = identityMatrix(4);
128-
System.out.println("\nIdentity Matrix 4x4: "+Arrays.deepToString(I));
130+
System.out.println("\nIdentity matrix_operation.Matrix 4x4: "+Arrays.deepToString(I));
129131

130132
double[][] A = randomMatrix(4, 4, -5, 5);
131-
System.out.println("\nRandom Matrix A: "+Arrays.deepToString(A));
133+
System.out.println("\nRandom matrix_operation.Matrix A: "+Arrays.deepToString(A));
132134

133135
A = elementMatrixMultiplication(A, 2);
134-
System.out.println("\nMatrix A multiplied by 2: "+Arrays.deepToString(A));
136+
System.out.println("\nmatrix_operation.Matrix A multiplied by 2: "+Arrays.deepToString(A));
135137

136138
double[][] A_T = transposeMatrix(A);
137-
System.out.println("\nMatrix A Transpose: "+Arrays.deepToString(A_T));
139+
System.out.println("\nmatrix_operation.Matrix A Transpose: "+Arrays.deepToString(A_T));
138140

139141
double[][] B = randomMatrix(4, 4, -5, 5);
140-
System.out.println("\nRandom Matrix B: "+Arrays.deepToString(B));
142+
System.out.println("\nRandom matrix_operation.Matrix B: "+Arrays.deepToString(B));
141143

142144
double[][] C = matrixAddition(A, B);
143145
System.out.println("\nA + B: "+Arrays.deepToString(C));

0 commit comments

Comments
 (0)