iSharkFly-Docs/java-tutorials
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

[BAEL-9551] - Splitted algorithms into 4 modules

Browse Source
This commit is contained in:
amit2103 2018-10-28 23:29:09 +05:30
parent c10101a9ac
commit 539ce3e787
164 changed files with 1735 additions and 1241 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
algorithms-genetic/.gitignore vendored Normal file
View File

@ -0,0 +1,4 @@
/target/
.settings/
.classpath
.project

4
algorithms-genetic/README.md Normal file
View File

@ -0,0 +1,4 @@
## Relevant articles:
- [Introduction to Jenetics Library](http://www.baeldung.com/jenetics)
- [Ant Colony Optimization](http://www.baeldung.com/java-ant-colony-optimization)

190
algorithms/pom.xml → algorithms-genetic/pom.xml
View File

@ -1,96 +1,96 @@
<project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" <project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd"> xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
<modelVersion>4.0.0</modelVersion> <modelVersion>4.0.0</modelVersion>
<groupId>com.baeldung</groupId> <groupId>com.baeldung</groupId>
<artifactId>algorithms</artifactId> <artifactId>algorithms-genetic</artifactId>
<version>0.0.1-SNAPSHOT</version> <version>0.0.1-SNAPSHOT</version>
<parent> <parent>
<groupId>com.baeldung</groupId> <groupId>com.baeldung</groupId>
<artifactId>parent-modules</artifactId> <artifactId>parent-modules</artifactId>
<version>1.0.0-SNAPSHOT</version> <version>1.0.0-SNAPSHOT</version>
</parent> </parent>
<dependencies> <dependencies>
<dependency> <dependency>
<groupId>org.apache.commons</groupId> <groupId>org.apache.commons</groupId>
<artifactId>commons-math3</artifactId> <artifactId>commons-math3</artifactId>
<version>${commons-math3.version}</version> <version>${commons-math3.version}</version>
</dependency> </dependency>
<dependency> <dependency>
<groupId>commons-codec</groupId> <groupId>commons-codec</groupId>
<artifactId>commons-codec</artifactId> <artifactId>commons-codec</artifactId>
<version>${commons-codec.version}</version> <version>${commons-codec.version}</version>
</dependency> </dependency>
<dependency> <dependency>
<groupId>org.projectlombok</groupId> <groupId>org.projectlombok</groupId>
<artifactId>lombok</artifactId> <artifactId>lombok</artifactId>
<version>${lombok.version}</version> <version>${lombok.version}</version>
<scope>provided</scope> <scope>provided</scope>
</dependency> </dependency>
<dependency> <dependency>
<groupId>io.jenetics</groupId> <groupId>io.jenetics</groupId>
<artifactId>jenetics</artifactId> <artifactId>jenetics</artifactId>
<version>${io.jenetics.version}</version> <version>${io.jenetics.version}</version>
</dependency> </dependency>
<dependency> <dependency>
<groupId>org.jgrapht</groupId> <groupId>org.jgrapht</groupId>
<artifactId>jgrapht-core</artifactId> <artifactId>jgrapht-core</artifactId>
<version>${org.jgrapht.core.version}</version> <version>${org.jgrapht.core.version}</version>
</dependency> </dependency>
<dependency> <dependency>
<groupId>pl.allegro.finance</groupId> <groupId>pl.allegro.finance</groupId>
<artifactId>tradukisto</artifactId> <artifactId>tradukisto</artifactId>
<version>${tradukisto.version}</version> <version>${tradukisto.version}</version>
</dependency> </dependency>
<dependency> <dependency>
<groupId>org.assertj</groupId> <groupId>org.assertj</groupId>
<artifactId>assertj-core</artifactId> <artifactId>assertj-core</artifactId>
<version>${org.assertj.core.version}</version> <version>${org.assertj.core.version}</version>
<scope>test</scope> <scope>test</scope>
</dependency> </dependency>
</dependencies> </dependencies>
<build> <build>
<pluginManagement> <pluginManagement>
<plugins> <plugins>
<plugin> <plugin>
<groupId>org.codehaus.mojo</groupId> <groupId>org.codehaus.mojo</groupId>
<artifactId>exec-maven-plugin</artifactId> <artifactId>exec-maven-plugin</artifactId>
<version>${exec-maven-plugin.version}</version> <version>${exec-maven-plugin.version}</version>
</plugin> </plugin>
</plugins> </plugins>
</pluginManagement> </pluginManagement>
</build> </build>
<reporting> <reporting>
<plugins> <plugins>
<plugin> <plugin>
<groupId>org.codehaus.mojo</groupId> <groupId>org.codehaus.mojo</groupId>
<artifactId>cobertura-maven-plugin</artifactId> <artifactId>cobertura-maven-plugin</artifactId>
<version>2.7</version> <version>2.7</version>
<configuration> <configuration>
<instrumentation> <instrumentation>
<ignores> <ignores>
<ignore>com/baeldung/algorithms/dijkstra/*</ignore> <ignore>com/baeldung/algorithms/dijkstra/*</ignore>
</ignores> </ignores>
<excludes> <excludes>
<exclude>com/baeldung/algorithms/dijkstra/*</exclude> <exclude>com/baeldung/algorithms/dijkstra/*</exclude>
</excludes> </excludes>
</instrumentation> </instrumentation>
</configuration> </configuration>
</plugin> </plugin>
</plugins> </plugins>
</reporting> </reporting>
<properties> <properties>
<lombok.version>1.16.12</lombok.version> <lombok.version>1.16.12</lombok.version>
<commons-math3.version>3.6.1</commons-math3.version> <commons-math3.version>3.6.1</commons-math3.version>
<tradukisto.version>1.0.1</tradukisto.version> <tradukisto.version>1.0.1</tradukisto.version>
<io.jenetics.version>3.7.0</io.jenetics.version> <io.jenetics.version>3.7.0</io.jenetics.version>
<org.jgrapht.core.version>1.0.1</org.jgrapht.core.version> <org.jgrapht.core.version>1.0.1</org.jgrapht.core.version>
<org.assertj.core.version>3.9.0</org.assertj.core.version> <org.assertj.core.version>3.9.0</org.assertj.core.version>
<commons-codec.version>1.11</commons-codec.version> <commons-codec.version>1.11</commons-codec.version>
</properties> </properties>
</project> </project>

0
algorithms/roundUpToHundred/.gitignore → algorithms-genetic/roundUpToHundred/.gitignore vendored
View File

40
algorithms/roundUpToHundred/src/com/java/src/RoundUpToHundred.java → algorithms-genetic/roundUpToHundred/src/com/java/src/RoundUpToHundred.java
View File

@ -1,20 +1,20 @@
package com.java.src; package com.java.src;
import java.util.Scanner; import java.util.Scanner;
public class RoundUpToHundred { public class RoundUpToHundred {
public static void main(String[] args) { public static void main(String[] args) {
Scanner scanner = new Scanner(System.in); Scanner scanner = new Scanner(System.in);
double input = scanner.nextDouble(); double input = scanner.nextDouble();
scanner.close(); scanner.close();
RoundUpToHundred.round(input); RoundUpToHundred.round(input);
} }
static long round(double input) { static long round(double input) {
long i = (long) Math.ceil(input); long i = (long) Math.ceil(input);
return ((i + 99) / 100) * 100; return ((i + 99) / 100) * 100;
}; };
} }

28
algorithms/roundUpToHundred/src/com/java/src/RoundUpToHundredTest.java → algorithms-genetic/roundUpToHundred/src/com/java/src/RoundUpToHundredTest.java
View File

@ -1,14 +1,14 @@
package com.java.src; package com.java.src;
import static org.junit.Assert.assertEquals; import static org.junit.Assert.assertEquals;
import org.junit.Test; import org.junit.Test;
public class RoundUpToHundredTest { public class RoundUpToHundredTest {
@Test @Test
public void givenInput_whenRound_thenRoundUpToTheNearestHundred() { public void givenInput_whenRound_thenRoundUpToTheNearestHundred() {
assertEquals("Rounded up to hundred", 100, RoundUpToHundred.round(99)); assertEquals("Rounded up to hundred", 100, RoundUpToHundred.round(99));
assertEquals("Rounded up to three hundred ", 300, RoundUpToHundred.round(200.2)); assertEquals("Rounded up to three hundred ", 300, RoundUpToHundred.round(200.2));
assertEquals("Returns same rounded value", 400, RoundUpToHundred.round(400)); assertEquals("Returns same rounded value", 400, RoundUpToHundred.round(400));
} }
} }

0
algorithms/src/main/java/com/baeldung/algorithms/RunAlgorithm.java → algorithms-genetic/src/main/java/com/baeldung/algorithms/RunAlgorithm.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/ga/annealing/City.java → algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/annealing/City.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/ga/annealing/SimulatedAnnealing.java → algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/annealing/SimulatedAnnealing.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/ga/annealing/Travel.java → algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/annealing/Travel.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/ga/ant_colony/Ant.java → algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/ant_colony/Ant.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/ga/ant_colony/AntColonyOptimization.java → algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/ant_colony/AntColonyOptimization.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/ga/binary/Individual.java → algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/binary/Individual.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/ga/binary/Population.java → algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/binary/Population.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/ga/binary/SimpleGeneticAlgorithm.java → algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/binary/SimpleGeneticAlgorithm.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/ga/dijkstra/Dijkstra.java → algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/dijkstra/Dijkstra.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/ga/dijkstra/Graph.java → algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/dijkstra/Graph.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/ga/dijkstra/Node.java → algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/dijkstra/Node.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/ga/jenetics/Knapsack.java → algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/jenetics/Knapsack.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/ga/jenetics/KnapsackFF.java → algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/jenetics/KnapsackFF.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/ga/jenetics/KnapsackItem.java → algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/jenetics/KnapsackItem.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/ga/jenetics/SimpleGeneticAlgorithm.java → algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/jenetics/SimpleGeneticAlgorithm.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/ga/jenetics/SpringsteenProblem.java → algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/jenetics/SpringsteenProblem.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/ga/jenetics/SpringsteenRecord.java → algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/jenetics/SpringsteenRecord.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/ga/jenetics/SubsetSum.java → algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/jenetics/SubsetSum.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/ga/jenetics/TravelingSalesman.java → algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/jenetics/TravelingSalesman.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/slope_one/InputData.java → algorithms-genetic/src/main/java/com/baeldung/algorithms/slope_one/InputData.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/slope_one/Item.java → algorithms-genetic/src/main/java/com/baeldung/algorithms/slope_one/Item.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/slope_one/SlopeOne.java → algorithms-genetic/src/main/java/com/baeldung/algorithms/slope_one/SlopeOne.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/slope_one/User.java → algorithms-genetic/src/main/java/com/baeldung/algorithms/slope_one/User.java
View File

0
algorithms/src/main/resources/logback.xml → algorithms-genetic/src/main/resources/logback.xml
View File

0
algorithms/src/test/java/com/baeldung/algorithms/AntColonyOptimizationLongRunningUnitTest.java → algorithms-genetic/src/test/java/com/baeldung/algorithms/AntColonyOptimizationLongRunningUnitTest.java
View File

0
algorithms/src/test/java/com/baeldung/algorithms/BinaryGeneticAlgorithmLongRunningUnitTest.java → algorithms-genetic/src/test/java/com/baeldung/algorithms/BinaryGeneticAlgorithmLongRunningUnitTest.java
View File

0
algorithms/src/test/java/com/baeldung/algorithms/DijkstraAlgorithmLongRunningUnitTest.java → algorithms-genetic/src/test/java/com/baeldung/algorithms/DijkstraAlgorithmLongRunningUnitTest.java
View File

0
algorithms/src/test/java/com/baeldung/algorithms/SimulatedAnnealingLongRunningUnitTest.java → algorithms-genetic/src/test/java/com/baeldung/algorithms/SimulatedAnnealingLongRunningUnitTest.java
View File

4
algorithms-miscellaneous-1/.gitignore vendored Normal file
View File

@ -0,0 +1,4 @@
/target/
.settings/
.classpath
.project

12
algorithms-miscellaneous-1/README.md Normal file
View File

@ -0,0 +1,12 @@
## Relevant articles:
- [Validating Input With Finite Automata in Java](http://www.baeldung.com/java-finite-automata)
- [Example of Hill Climbing Algorithm](http://www.baeldung.com/java-hill-climbing-algorithm)
- [Monte Carlo Tree Search for Tic-Tac-Toe Game](http://www.baeldung.com/java-monte-carlo-tree-search)
- [Binary Search Algorithm in Java](http://www.baeldung.com/java-binary-search)
- [Introduction to Minimax Algorithm](http://www.baeldung.com/java-minimax-algorithm)
- [How to Calculate Levenshtein Distance in Java?](http://www.baeldung.com/java-levenshtein-distance)
- [How to Find the Kth Largest Element in Java](http://www.baeldung.com/java-kth-largest-element)
- [Multi-Swarm Optimization Algorithm in Java](http://www.baeldung.com/java-multi-swarm-algorithm)
- [String Search Algorithms for Large Texts](http://www.baeldung.com/java-full-text-search-algorithms)
- [Check If a String Contains All The Letters of The Alphabet](https://www.baeldung.com/java-string-contains-all-letters)

96
algorithms-miscellaneous-1/pom.xml Normal file
View File

@ -0,0 +1,96 @@
<project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
<modelVersion>4.0.0</modelVersion>
<groupId>com.baeldung</groupId>
<artifactId>algorithms-miscellaneous-1</artifactId>
<version>0.0.1-SNAPSHOT</version>
<parent>
<groupId>com.baeldung</groupId>
<artifactId>parent-modules</artifactId>
<version>1.0.0-SNAPSHOT</version>
</parent>
<dependencies>
<dependency>
<groupId>org.apache.commons</groupId>
<artifactId>commons-math3</artifactId>
<version>${commons-math3.version}</version>
</dependency>
<dependency>
<groupId>commons-codec</groupId>
<artifactId>commons-codec</artifactId>
<version>${commons-codec.version}</version>
</dependency>
<dependency>
<groupId>org.projectlombok</groupId>
<artifactId>lombok</artifactId>
<version>${lombok.version}</version>
<scope>provided</scope>
</dependency>
<dependency>
<groupId>io.jenetics</groupId>
<artifactId>jenetics</artifactId>
<version>${io.jenetics.version}</version>
</dependency>
<dependency>
<groupId>org.jgrapht</groupId>
<artifactId>jgrapht-core</artifactId>
<version>${org.jgrapht.core.version}</version>
</dependency>
<dependency>
<groupId>pl.allegro.finance</groupId>
<artifactId>tradukisto</artifactId>
<version>${tradukisto.version}</version>
</dependency>
<dependency>
<groupId>org.assertj</groupId>
<artifactId>assertj-core</artifactId>
<version>${org.assertj.core.version}</version>
<scope>test</scope>
</dependency>
</dependencies>
<build>
<pluginManagement>
<plugins>
<plugin>
<groupId>org.codehaus.mojo</groupId>
<artifactId>exec-maven-plugin</artifactId>
<version>${exec-maven-plugin.version}</version>
</plugin>
</plugins>
</pluginManagement>
</build>
<reporting>
<plugins>
<plugin>
<groupId>org.codehaus.mojo</groupId>
<artifactId>cobertura-maven-plugin</artifactId>
<version>2.7</version>
<configuration>
<instrumentation>
<ignores>
<ignore>com/baeldung/algorithms/dijkstra/*</ignore>
</ignores>
<excludes>
<exclude>com/baeldung/algorithms/dijkstra/*</exclude>
</excludes>
</instrumentation>
</configuration>
</plugin>
</plugins>
</reporting>
<properties>
<lombok.version>1.16.12</lombok.version>
<commons-math3.version>3.6.1</commons-math3.version>
<tradukisto.version>1.0.1</tradukisto.version>
<io.jenetics.version>3.7.0</io.jenetics.version>
<org.jgrapht.core.version>1.0.1</org.jgrapht.core.version>
<org.assertj.core.version>3.9.0</org.assertj.core.version>
<commons-codec.version>1.11</commons-codec.version>
</properties>
</project>

1
algorithms-miscellaneous-1/roundUpToHundred/.gitignore vendored Normal file
View File

@ -0,0 +1 @@
/bin/

20
algorithms-miscellaneous-1/roundUpToHundred/src/com/java/src/RoundUpToHundred.java Normal file
View File

@ -0,0 +1,20 @@
package com.java.src;
import java.util.Scanner;
public class RoundUpToHundred {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
double input = scanner.nextDouble();
scanner.close();
RoundUpToHundred.round(input);
}
static long round(double input) {
long i = (long) Math.ceil(input);
return ((i + 99) / 100) * 100;
};
}

14
algorithms-miscellaneous-1/roundUpToHundred/src/com/java/src/RoundUpToHundredTest.java Normal file
View File

@ -0,0 +1,14 @@
package com.java.src;
import static org.junit.Assert.assertEquals;
import org.junit.Test;
public class RoundUpToHundredTest {
@Test
public void givenInput_whenRound_thenRoundUpToTheNearestHundred() {
assertEquals("Rounded up to hundred", 100, RoundUpToHundred.round(99));
assertEquals("Rounded up to three hundred ", 300, RoundUpToHundred.round(200.2));
assertEquals("Returns same rounded value", 400, RoundUpToHundred.round(400));
}
}

0
algorithms/src/main/java/com/baeldung/algorithms/automata/FiniteStateMachine.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/automata/FiniteStateMachine.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/automata/RtFiniteStateMachine.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/automata/RtFiniteStateMachine.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/automata/RtState.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/automata/RtState.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/automata/RtTransition.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/automata/RtTransition.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/automata/State.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/automata/State.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/automata/Transition.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/automata/Transition.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/binarysearch/BinarySearch.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/binarysearch/BinarySearch.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/hillclimbing/HillClimbing.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/hillclimbing/HillClimbing.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/hillclimbing/State.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/hillclimbing/State.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/kthlargest/FindKthLargest.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/kthlargest/FindKthLargest.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/linesintersection/LinesIntersectionService.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/linesintersection/LinesIntersectionService.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/mcts/montecarlo/MonteCarloTreeSearch.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/mcts/montecarlo/MonteCarloTreeSearch.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/mcts/montecarlo/State.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/mcts/montecarlo/State.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/mcts/montecarlo/UCT.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/mcts/montecarlo/UCT.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/mcts/tictactoe/Board.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/mcts/tictactoe/Board.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/mcts/tictactoe/Position.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/mcts/tictactoe/Position.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/mcts/tree/Node.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/mcts/tree/Node.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/mcts/tree/Tree.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/mcts/tree/Tree.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/middleelementlookup/MiddleElementLookup.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/middleelementlookup/MiddleElementLookup.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/middleelementlookup/Node.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/middleelementlookup/Node.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/minimax/GameOfBones.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/minimax/GameOfBones.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/minimax/MiniMax.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/minimax/MiniMax.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/minimax/Node.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/minimax/Node.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/minimax/Tree.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/minimax/Tree.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/multiswarm/Constants.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/multiswarm/Constants.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/multiswarm/FitnessFunction.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/multiswarm/FitnessFunction.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/multiswarm/Multiswarm.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/multiswarm/Multiswarm.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/multiswarm/Particle.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/multiswarm/Particle.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/multiswarm/Swarm.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/multiswarm/Swarm.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/string/EnglishAlphabetLetters.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/string/EnglishAlphabetLetters.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/string/search/StringSearchAlgorithms.java → algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/string/search/StringSearchAlgorithms.java
View File

13
algorithms-miscellaneous-1/src/main/resources/logback.xml Normal file
View File

@ -0,0 +1,13 @@
<?xml version="1.0" encoding="UTF-8"?>
<configuration>
<appender name="STDOUT" class="ch.qos.logback.core.ConsoleAppender">
<encoder>
<pattern>%d{HH:mm:ss.SSS} [%thread] %-5level %logger{36} - %msg%n
</pattern>
</encoder>
</appender>
<root level="INFO">
<appender-ref ref="STDOUT" />
</root>
</configuration>

22
algorithms/src/main/resources/maze/maze1.txt → algorithms-miscellaneous-1/src/main/resources/maze/maze1.txt
View File

@ -1,12 +1,12 @@
S ######## S ########
# # # #
# ### ## # # ### ## #
# # # # # # # #
# # # # # # # # # #
# ## ##### # ## #####
# # # # # #
# # # # # # # # # #
##### #### ##### ####
# # E # # E
# # # # # # # #
########## ##########

42
algorithms/src/main/resources/maze/maze2.txt → algorithms-miscellaneous-1/src/main/resources/maze/maze2.txt
View File

@ -1,22 +1,22 @@
S ########################## S ##########################
# # # # # # # #
# # #### ############### # # # #### ############### #
# # # # # # # # # # # #
# # #### # # ############### # # #### # # ###############
# # # # # # # # # # # # # #
# # # #### ### ########### # # # # #### ### ########### #
# # # # # # # # # # # #
# ################## # # ################## #
######### # # # # # ######### # # # # #
# # #### # ####### # # # # #### # ####### # #
# # ### ### # # # # # # # ### ### # # # # #
# # ## # ##### # # # # ## # ##### # #
##### ####### # # # # # ##### ####### # # # # #
# # ## ## #### # # # # ## ## #### # #
# ##### ####### # # # ##### ####### # #
# # ############ # # ############
####### ######### # # ####### ######### # #
# # ######## # # # ######## #
# ####### ###### ## # E # ####### ###### ## # E
# # # ## # # # # ## #
############################ ############################

0
algorithms/src/test/java/com/baeldung/algorithms/HillClimbingAlgorithmUnitTest.java → algorithms-miscellaneous-1/src/test/java/com/baeldung/algorithms/HillClimbingAlgorithmUnitTest.java
View File

0
algorithms/src/test/java/com/baeldung/algorithms/MiddleElementLookupUnitTest.java → algorithms-miscellaneous-1/src/test/java/com/baeldung/algorithms/MiddleElementLookupUnitTest.java
View File

0
algorithms/src/test/java/com/baeldung/algorithms/RtFiniteStateMachineLongRunningUnitTest.java → algorithms-miscellaneous-1/src/test/java/com/baeldung/algorithms/RtFiniteStateMachineLongRunningUnitTest.java
View File

0
algorithms/src/test/java/com/baeldung/algorithms/StringSearchAlgorithmsUnitTest.java → algorithms-miscellaneous-1/src/test/java/com/baeldung/algorithms/StringSearchAlgorithmsUnitTest.java
View File

0
algorithms/src/test/java/com/baeldung/algorithms/binarysearch/BinarySearchUnitTest.java → algorithms-miscellaneous-1/src/test/java/com/baeldung/algorithms/binarysearch/BinarySearchUnitTest.java
View File

0
algorithms/src/test/java/com/baeldung/algorithms/kthlargest/FindKthLargestUnitTest.java → algorithms-miscellaneous-1/src/test/java/com/baeldung/algorithms/kthlargest/FindKthLargestUnitTest.java
View File

0
algorithms/src/test/java/com/baeldung/algorithms/linesintersection/LinesIntersectionServiceUnitTest.java → algorithms-miscellaneous-1/src/test/java/com/baeldung/algorithms/linesintersection/LinesIntersectionServiceUnitTest.java
View File

0
algorithms/src/test/java/com/baeldung/algorithms/mcts/MCTSUnitTest.java → algorithms-miscellaneous-1/src/test/java/com/baeldung/algorithms/mcts/MCTSUnitTest.java
View File

0
algorithms/src/test/java/com/baeldung/algorithms/minimax/MinimaxUnitTest.java → algorithms-miscellaneous-1/src/test/java/com/baeldung/algorithms/minimax/MinimaxUnitTest.java
View File

0
algorithms/src/test/java/com/baeldung/algorithms/multiswarm/LolFitnessFunction.java → algorithms-miscellaneous-1/src/test/java/com/baeldung/algorithms/multiswarm/LolFitnessFunction.java
View File

0
algorithms/src/test/java/com/baeldung/algorithms/multiswarm/MultiswarmUnitTest.java → algorithms-miscellaneous-1/src/test/java/com/baeldung/algorithms/multiswarm/MultiswarmUnitTest.java
View File

0
algorithms/src/test/java/com/baeldung/algorithms/string/EnglishAlphabetLettersUnitTest.java → algorithms-miscellaneous-1/src/test/java/com/baeldung/algorithms/string/EnglishAlphabetLettersUnitTest.java
View File

0
algorithms/src/test/java/com/baeldung/algorithms/support/MayFailRule.java → algorithms-miscellaneous-1/src/test/java/com/baeldung/algorithms/support/MayFailRule.java
View File

4
algorithms-miscellaneous-2/.gitignore vendored Normal file
View File

@ -0,0 +1,4 @@
/target/
.settings/
.classpath
.project

16
algorithms/README.md → algorithms-miscellaneous-2/README.md
View File

@ -2,20 +2,8 @@
- [Dijkstra Algorithm in Java](http://www.baeldung.com/java-dijkstra) - [Dijkstra Algorithm in Java](http://www.baeldung.com/java-dijkstra)
- [Introduction to Cobertura](http://www.baeldung.com/cobertura) - [Introduction to Cobertura](http://www.baeldung.com/cobertura)
- [Ant Colony Optimization](http://www.baeldung.com/java-ant-colony-optimization)
- [Validating Input With Finite Automata in Java](http://www.baeldung.com/java-finite-automata)
- [Introduction to Jenetics Library](http://www.baeldung.com/jenetics)
- [Example of Hill Climbing Algorithm](http://www.baeldung.com/java-hill-climbing-algorithm)
- [Monte Carlo Tree Search for Tic-Tac-Toe Game](http://www.baeldung.com/java-monte-carlo-tree-search)
- [String Search Algorithms for Large Texts](http://www.baeldung.com/java-full-text-search-algorithms)
- [Test a Linked List for Cyclicity](http://www.baeldung.com/java-linked-list-cyclicity) - [Test a Linked List for Cyclicity](http://www.baeldung.com/java-linked-list-cyclicity)
- [Binary Search Algorithm in Java](http://www.baeldung.com/java-binary-search)
- [Bubble Sort in Java](http://www.baeldung.com/java-bubble-sort)
- [Introduction to JGraphT](http://www.baeldung.com/jgrapht) - [Introduction to JGraphT](http://www.baeldung.com/jgrapht)
- [Introduction to Minimax Algorithm](http://www.baeldung.com/java-minimax-algorithm)
- [How to Calculate Levenshtein Distance in Java?](http://www.baeldung.com/java-levenshtein-distance)
- [How to Find the Kth Largest Element in Java](http://www.baeldung.com/java-kth-largest-element)
- [Multi-Swarm Optimization Algorithm in Java](http://www.baeldung.com/java-multi-swarm-algorithm)
- [A Maze Solver in Java](http://www.baeldung.com/java-solve-maze) - [A Maze Solver in Java](http://www.baeldung.com/java-solve-maze)
- [Create a Sudoku Solver in Java](http://www.baeldung.com/java-sudoku) - [Create a Sudoku Solver in Java](http://www.baeldung.com/java-sudoku)
- [Displaying Money Amounts in Words](http://www.baeldung.com/java-money-into-words) - [Displaying Money Amounts in Words](http://www.baeldung.com/java-money-into-words)
@ -27,10 +15,6 @@
- [Check If Two Rectangles Overlap In Java](https://www.baeldung.com/java-check-if-two-rectangles-overlap) - [Check If Two Rectangles Overlap In Java](https://www.baeldung.com/java-check-if-two-rectangles-overlap)
- [Calculate the Distance Between Two Points in Java](https://www.baeldung.com/java-distance-between-two-points) - [Calculate the Distance Between Two Points in Java](https://www.baeldung.com/java-distance-between-two-points)
- [Find the Intersection of Two Lines in Java](https://www.baeldung.com/java-intersection-of-two-lines) - [Find the Intersection of Two Lines in Java](https://www.baeldung.com/java-intersection-of-two-lines)
- [Check If a String Contains All The Letters of The Alphabet](https://www.baeldung.com/java-string-contains-all-letters)
- [Round Up to the Nearest Hundred](https://www.baeldung.com/java-round-up-nearest-hundred) - [Round Up to the Nearest Hundred](https://www.baeldung.com/java-round-up-nearest-hundred)
- [Merge Sort in Java](https://www.baeldung.com/java-merge-sort)
- [Calculate Percentage in Java](https://www.baeldung.com/java-calculate-percentage) - [Calculate Percentage in Java](https://www.baeldung.com/java-calculate-percentage)
- [Quicksort Algorithm Implementation in Java](https://www.baeldung.com/java-quicksort)
- [Insertion Sort in Java](https://www.baeldung.com/java-insertion-sort)
- [Converting Between Byte Arrays and Hexadecimal Strings in Java](https://www.baeldung.com/java-byte-arrays-hex-strings) - [Converting Between Byte Arrays and Hexadecimal Strings in Java](https://www.baeldung.com/java-byte-arrays-hex-strings)

96
algorithms-miscellaneous-2/pom.xml Normal file
View File

@ -0,0 +1,96 @@
<project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
<modelVersion>4.0.0</modelVersion>
<groupId>com.baeldung</groupId>
<artifactId>algorithms-miscellaneous-2</artifactId>
<version>0.0.1-SNAPSHOT</version>
<parent>
<groupId>com.baeldung</groupId>
<artifactId>parent-modules</artifactId>
<version>1.0.0-SNAPSHOT</version>
</parent>
<dependencies>
<dependency>
<groupId>org.apache.commons</groupId>
<artifactId>commons-math3</artifactId>
<version>${commons-math3.version}</version>
</dependency>
<dependency>
<groupId>commons-codec</groupId>
<artifactId>commons-codec</artifactId>
<version>${commons-codec.version}</version>
</dependency>
<dependency>
<groupId>org.projectlombok</groupId>
<artifactId>lombok</artifactId>
<version>${lombok.version}</version>
<scope>provided</scope>
</dependency>
<dependency>
<groupId>io.jenetics</groupId>
<artifactId>jenetics</artifactId>
<version>${io.jenetics.version}</version>
</dependency>
<dependency>
<groupId>org.jgrapht</groupId>
<artifactId>jgrapht-core</artifactId>
<version>${org.jgrapht.core.version}</version>
</dependency>
<dependency>
<groupId>pl.allegro.finance</groupId>
<artifactId>tradukisto</artifactId>
<version>${tradukisto.version}</version>
</dependency>
<dependency>
<groupId>org.assertj</groupId>
<artifactId>assertj-core</artifactId>
<version>${org.assertj.core.version}</version>
<scope>test</scope>
</dependency>
</dependencies>
<build>
<pluginManagement>
<plugins>
<plugin>
<groupId>org.codehaus.mojo</groupId>
<artifactId>exec-maven-plugin</artifactId>
<version>${exec-maven-plugin.version}</version>
</plugin>
</plugins>
</pluginManagement>
</build>
<reporting>
<plugins>
<plugin>
<groupId>org.codehaus.mojo</groupId>
<artifactId>cobertura-maven-plugin</artifactId>
<version>2.7</version>
<configuration>
<instrumentation>
<ignores>
<ignore>com/baeldung/algorithms/dijkstra/*</ignore>
</ignores>
<excludes>
<exclude>com/baeldung/algorithms/dijkstra/*</exclude>
</excludes>
</instrumentation>
</configuration>
</plugin>
</plugins>
</reporting>
<properties>
<lombok.version>1.16.12</lombok.version>
<commons-math3.version>3.6.1</commons-math3.version>
<tradukisto.version>1.0.1</tradukisto.version>
<io.jenetics.version>3.7.0</io.jenetics.version>
<org.jgrapht.core.version>1.0.1</org.jgrapht.core.version>
<org.assertj.core.version>3.9.0</org.assertj.core.version>
<commons-codec.version>1.11</commons-codec.version>
</properties>
</project>

1
algorithms-miscellaneous-2/roundUpToHundred/.gitignore vendored Normal file
View File

@ -0,0 +1 @@
/bin/

20
algorithms-miscellaneous-2/roundUpToHundred/src/com/java/src/RoundUpToHundred.java Normal file
View File

@ -0,0 +1,20 @@
package com.java.src;
import java.util.Scanner;
public class RoundUpToHundred {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
double input = scanner.nextDouble();
scanner.close();
RoundUpToHundred.round(input);
}
static long round(double input) {
long i = (long) Math.ceil(input);
return ((i + 99) / 100) * 100;
};
}

14
algorithms-miscellaneous-2/roundUpToHundred/src/com/java/src/RoundUpToHundredTest.java Normal file
View File

@ -0,0 +1,14 @@
package com.java.src;
import static org.junit.Assert.assertEquals;
import org.junit.Test;
public class RoundUpToHundredTest {
@Test
public void givenInput_whenRound_thenRoundUpToTheNearestHundred() {
assertEquals("Rounded up to hundred", 100, RoundUpToHundred.round(99));
assertEquals("Rounded up to three hundred ", 300, RoundUpToHundred.round(200.2));
assertEquals("Returns same rounded value", 400, RoundUpToHundred.round(400));
}
}

0
algorithms/src/main/java/com/baeldung/algorithms/conversion/HexStringConverter.java → algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/conversion/HexStringConverter.java
View File

0
algorithms/src/main/java/com/baeldung/algorithms/distancebetweenpoints/DistanceBetweenPointsService.java → algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/distancebetweenpoints/DistanceBetweenPointsService.java
View File

30
algorithms/src/main/java/com/baeldung/algorithms/editdistance/EditDistanceBase.java → algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/editdistance/EditDistanceBase.java
View File

@ -1,15 +1,15 @@
package com.baeldung.algorithms.editdistance; package com.baeldung.algorithms.editdistance;
import java.util.Arrays; import java.util.Arrays;
public class EditDistanceBase { public class EditDistanceBase {
static int costOfSubstitution(char a, char b) { static int costOfSubstitution(char a, char b) {
return a == b ? 0 : 1; return a == b ? 0 : 1;
} }
static int min(int... numbers) { static int min(int... numbers) {
return Arrays.stream(numbers) return Arrays.stream(numbers)
.min().orElse(Integer.MAX_VALUE); .min().orElse(Integer.MAX_VALUE);
} }
} }

52
algorithms/src/main/java/com/baeldung/algorithms/editdistance/EditDistanceDynamicProgramming.java → algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/editdistance/EditDistanceDynamicProgramming.java
View File

@ -1,26 +1,26 @@
package com.baeldung.algorithms.editdistance; package com.baeldung.algorithms.editdistance;
public class EditDistanceDynamicProgramming extends EditDistanceBase { public class EditDistanceDynamicProgramming extends EditDistanceBase {
static int calculate(String x, String y) { static int calculate(String x, String y) {
int[][] dp = new int[x.length() + 1][y.length() + 1]; int[][] dp = new int[x.length() + 1][y.length() + 1];
for (int i = 0; i <= x.length(); i++) { for (int i = 0; i <= x.length(); i++) {
for (int j = 0; j <= y.length(); j++) { for (int j = 0; j <= y.length(); j++) {
if (i == 0) if (i == 0)
dp[i][j] = j; dp[i][j] = j;
else if (j == 0) else if (j == 0)
dp[i][j] = i; dp[i][j] = i;
else { else {
dp[i][j] = min(dp[i - 1][j - 1] dp[i][j] = min(dp[i - 1][j - 1]
+ costOfSubstitution(x.charAt(i - 1), y.charAt(j - 1)), + costOfSubstitution(x.charAt(i - 1), y.charAt(j - 1)),
dp[i - 1][j] + 1, dp[i][j - 1] + 1); dp[i - 1][j] + 1, dp[i][j - 1] + 1);
} }
} }
} }
return dp[x.length()][y.length()]; return dp[x.length()][y.length()];
} }
} }

42
algorithms/src/main/java/com/baeldung/algorithms/editdistance/EditDistanceRecursive.java → algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/editdistance/EditDistanceRecursive.java
View File

@ -1,21 +1,21 @@
package com.baeldung.algorithms.editdistance; package com.baeldung.algorithms.editdistance;
public class EditDistanceRecursive extends EditDistanceBase { public class EditDistanceRecursive extends EditDistanceBase {
static int calculate(String x, String y) { static int calculate(String x, String y) {
if (x.isEmpty()) { if (x.isEmpty()) {
return y.length(); return y.length();
} }
if (y.isEmpty()) { if (y.isEmpty()) {
return x.length(); return x.length();
} }
int substitution = calculate(x.substring(1), y.substring(1)) + costOfSubstitution(x.charAt(0), y.charAt(0)); int substitution = calculate(x.substring(1), y.substring(1)) + costOfSubstitution(x.charAt(0), y.charAt(0));
int insertion = calculate(x, y.substring(1)) + 1; int insertion = calculate(x, y.substring(1)) + 1;
int deletion = calculate(x.substring(1), y) + 1; int deletion = calculate(x.substring(1), y) + 1;
return min(substitution, insertion, deletion); return min(substitution, insertion, deletion);
} }
} }

76
algorithms/src/main/java/com/baeldung/algorithms/linkedlist/CycleDetectionBruteForce.java → algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/linkedlist/CycleDetectionBruteForce.java
View File

@ -1,38 +1,38 @@
package com.baeldung.algorithms.linkedlist; package com.baeldung.algorithms.linkedlist;
public class CycleDetectionBruteForce { public class CycleDetectionBruteForce {
public static <T> CycleDetectionResult<T> detectCycle(Node<T> head) { public static <T> CycleDetectionResult<T> detectCycle(Node<T> head) {
if (head == null) { if (head == null) {
return new CycleDetectionResult<>(false, null); return new CycleDetectionResult<>(false, null);
} }
Node<T> it1 = head; Node<T> it1 = head;
int nodesTraversedByOuter = 0; int nodesTraversedByOuter = 0;
while (it1 != null && it1.next != null) { while (it1 != null && it1.next != null) {
it1 = it1.next; it1 = it1.next;
nodesTraversedByOuter++; nodesTraversedByOuter++;
int x = nodesTraversedByOuter; int x = nodesTraversedByOuter;
Node<T> it2 = head; Node<T> it2 = head;
int noOfTimesCurrentNodeVisited = 0; int noOfTimesCurrentNodeVisited = 0;
while (x > 0) { while (x > 0) {
it2 = it2.next; it2 = it2.next;
if (it2 == it1) { if (it2 == it1) {
noOfTimesCurrentNodeVisited++; noOfTimesCurrentNodeVisited++;
} }
if (noOfTimesCurrentNodeVisited == 2) { if (noOfTimesCurrentNodeVisited == 2) {
return new CycleDetectionResult<>(true, it1); return new CycleDetectionResult<>(true, it1);
} }
x--; x--;
} }
} }
return new CycleDetectionResult<>(false, null); return new CycleDetectionResult<>(false, null);
} }
} }

Some files were not shown because too many files have changed in this diff Show More