Merge pull request #8 from eugenp/master

update
2019-08-18 21:03:19 +02:00
parent 104daa7b29 8205672b29
commit 8470319d13
2111 changed files with 243676 additions and 8173 deletions
@@ -1,4 +1,5 @@
 */bin/*
+bin/

 *.class

@@ -21,6 +22,9 @@
 *.iws
 out/

+# VSCode
+.vscode/
+
 # Mac
 .DS_Store

@@ -77,4 +81,5 @@ apache-avro/src/main/java/com/baeldung/avro/model/
 jta/transaction-logs/
 software-security/sql-injection-samples/derby.log
 spring-soap/src/main/java/com/baeldung/springsoap/gen/
-/report-*.json
+/report-*.json
+transaction.log
@@ -1,12 +1,16 @@

-The "REST with Spring" Classes
+The Courses
 ==============================

-Here's the Master Class of REST With Spring (along with the newly announced Boot 2 material): <br/>
-**[>> THE REST WITH SPRING - MASTER CLASS](http://www.baeldung.com/rest-with-spring-course?utm_source=github&utm_medium=social&utm_content=tutorials&utm_campaign=rws#master-class)**

-And here's the Master Class of Learn Spring Security: <br/>
-**[>> LEARN SPRING SECURITY - MASTER CLASS](http://www.baeldung.com/learn-spring-security-course?utm_source=github&utm_medium=social&utm_content=tutorials&utm_campaign=lss#master-class)**
+Here's the new "Learn Spring" course: <br/>
+**[>> LEARN SPRING - THE MASTER CLASS](https://www.baeldung.com/learn-spring-course?utm_source=github&utm_medium=social&utm_content=tutorials&utm_campaign=ls#master-class)**
+
+Here's the Master Class of "REST With Spring" (along with the new announced Boot 2 material): <br/>
+**[>> THE REST WITH SPRING - MASTER CLASS](https://www.baeldung.com/rest-with-spring-course?utm_source=github&utm_medium=social&utm_content=tutorials&utm_campaign=rws#master-class)**
+
+And here's the Master Class of "Learn Spring Security": <br/>
+**[>> LEARN SPRING SECURITY - MASTER CLASS](https://www.baeldung.com/learn-spring-security-course?utm_source=github&utm_medium=social&utm_content=tutorials&utm_campaign=lss#master-class)**



@@ -15,7 +19,7 @@ Java and Spring Tutorials

 This project is **a collection of small and focused tutorials** - each covering a single and well defined area of development in the Java ecosystem. 
 A strong focus of these is, of course, the Spring Framework - Spring, Spring Boot and Spring Security. 
-In additional to Spring, the following technologies are in focus: `core Java`, `Jackson`, `HttpClient`, `Guava`. 
+In additional to Spring, the modules here are covering a number of aspects in Java. 


 Building the project
@@ -32,8 +36,15 @@ Running a Spring Boot module
 ====================
 To run a Spring Boot module run the command: `mvn spring-boot:run` in the module directory

-#Running Tests

+Working with the IDE
+====================
+This repo contains a large number of modules. 
+When you're working with an individual module, there's no need to import all of them (or build all of them) - you can simply import that particular module in either Eclipse or IntelliJ. 
+
+
+Running Tests
+=============
 The command `mvn clean install` will run the unit tests in a module.
 To run the integration tests, use the command `mvn clean install -Pintegration-lite-first`

@@ -42,7 +42,7 @@
        <dependency>
            <groupId>com.github.dpaukov</groupId>
            <artifactId>combinatoricslib3</artifactId>
-            <version>3.3.0</version>
+            <version>${combinatoricslib3.version}</version>
         </dependency>
    </dependencies>

@@ -83,6 +83,7 @@
        <org.assertj.core.version>3.9.0</org.assertj.core.version>
        <commons-codec.version>1.11</commons-codec.version>
        <guava.version>27.0.1-jre</guava.version>
+        <combinatoricslib3.version>3.3.0</combinatoricslib3.version>
    </properties>

 </project>
@@ -1,6 +1,9 @@
-## Relevant articles:
+## Relevant Articles:

 - [Java Two Pointer Technique](https://www.baeldung.com/java-two-pointer-technique)
 - [Implementing Simple State Machines with Java Enums](https://www.baeldung.com/java-enum-simple-state-machine)
 - [Converting Between Roman and Arabic Numerals in Java](http://www.baeldung.com/java-convert-roman-arabic)
 - [Practical Java Examples of the Big O Notation](http://www.baeldung.com/java-algorithm-complexity)
+- [Checking If a List Is Sorted in Java](https://www.baeldung.com/java-check-if-list-sorted)
+- [Checking if a Java Graph has a Cycle](https://www.baeldung.com/java-graph-has-a-cycle)
+- [A Guide to the Folding Technique in Java](https://www.baeldung.com/folding-hashing-technique)
@@ -1,5 +1,5 @@
 <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>
    <artifactId>algorithms-miscellaneous-3</artifactId>
    <version>0.0.1-SNAPSHOT</version>
@@ -18,17 +18,41 @@
            <version>${org.assertj.core.version}</version>
            <scope>test</scope>
        </dependency>
-        
+
        <dependency>
-        	<groupId>org.apache.commons</groupId>
-        	<artifactId>commons-collections4</artifactId>
-        	<version>${commons-collections4.version}</version>
+            <groupId>org.apache.commons</groupId>
+            <artifactId>commons-collections4</artifactId>
+            <version>${commons-collections4.version}</version>
        </dependency>
-        
+
        <dependency>
-        	<groupId>com.google.guava</groupId>
-        	<artifactId>guava</artifactId>
-        	<version>${guava.version}</version>
+            <groupId>com.google.guava</groupId>
+            <artifactId>guava</artifactId>
+            <version>${guava.version}</version>
+        </dependency>
+
+        <dependency>
+            <groupId>com.squareup.retrofit2</groupId>
+            <artifactId>retrofit</artifactId>
+            <version>${retrofit.version}</version>
+        </dependency>
+        <dependency>
+            <groupId>com.squareup.retrofit2</groupId>
+            <artifactId>converter-jackson</artifactId>
+            <version>${retrofit.version}</version>
+        </dependency>
+
+        <dependency>
+            <groupId>org.apache.commons</groupId>
+            <artifactId>commons-lang3</artifactId>
+            <version>3.8.1</version>
+        </dependency>
+
+        <dependency>
+            <groupId>pl.pragmatists</groupId>
+            <artifactId>JUnitParams</artifactId>
+            <version>1.1.0</version>
+            <scope>test</scope>
        </dependency>
    </dependencies>

@@ -48,5 +72,6 @@
        <org.assertj.core.version>3.9.0</org.assertj.core.version>
        <commons-collections4.version>4.3</commons-collections4.version>
        <guava.version>28.0-jre</guava.version>
+        <retrofit.version>2.6.0</retrofit.version>
    </properties>
 </project>
@@ -27,6 +27,7 @@ public class SortedListChecker {
            if (previous.compareTo(current) > 0) {
                return false;
            }
+            previous = current;
        }
        return true;
    }
@@ -43,6 +44,7 @@ public class SortedListChecker {
            if (employeeComparator.compare(previous, current) > 0) {
                return false;
            }
+            previous = current;
        }
        return true;
    }
@@ -0,0 +1,35 @@
+package com.baeldung.algorithms.interpolationsearch;
+
+public class InterpolationSearch {
+
+    public static int interpolationSearch(int[] data, int item) {
+
+        int highEnd = (data.length - 1);
+        int lowEnd = 0;
+
+        while (item >= data[lowEnd] && item <= data[highEnd] && lowEnd <= highEnd) {
+
+            int probe = lowEnd + (highEnd - lowEnd) * (item - data[lowEnd]) / (data[highEnd] - data[lowEnd]);
+
+            if (highEnd == lowEnd) {
+                if (data[lowEnd] == item) {
+                    return lowEnd;
+                } else {
+                    return -1;
+                }
+            }
+
+            if (data[probe] == item) {
+                return probe;
+            }
+
+            if (data[probe] < item) {
+                lowEnd = probe + 1;
+            } else {
+                highEnd = probe - 1;
+            }
+        }
+        return -1;
+    }
+
+}
@@ -0,0 +1,45 @@
+package com.baeldung.algorithms.kmeans;
+
+import java.util.Map;
+import java.util.Objects;
+
+/**
+ * Encapsulates all coordinates for a particular cluster centroid.
+ */
+public class Centroid {
+
+    /**
+     * The centroid coordinates.
+     */
+    private final Map<String, Double> coordinates;
+
+    public Centroid(Map<String, Double> coordinates) {
+        this.coordinates = coordinates;
+    }
+
+    public Map<String, Double> getCoordinates() {
+        return coordinates;
+    }
+
+    @Override
+    public boolean equals(Object o) {
+        if (this == o) {
+            return true;
+        }
+        if (o == null || getClass() != o.getClass()) {
+            return false;
+        }
+        Centroid centroid = (Centroid) o;
+        return Objects.equals(getCoordinates(), centroid.getCoordinates());
+    }
+
+    @Override
+    public int hashCode() {
+        return Objects.hash(getCoordinates());
+    }
+
+    @Override
+    public String toString() {
+        return "Centroid " + coordinates;
+    }
+}
@@ -0,0 +1,20 @@
+package com.baeldung.algorithms.kmeans;
+
+import java.util.Map;
+
+/**
+ * Defines a contract to calculate distance between two feature vectors. The less the
+ * calculated distance, the more two items are similar to each other.
+ */
+public interface Distance {
+
+    /**
+     * Calculates the distance between two feature vectors.
+     *
+     * @param f1 The first set of features.
+     * @param f2 The second set of features.
+     * @return Calculated distance.
+     * @throws IllegalArgumentException If the given feature vectors are invalid.
+     */
+    double calculate(Map<String, Double> f1, Map<String, Double> f2);
+}
@@ -0,0 +1,23 @@
+package com.baeldung.algorithms.kmeans;
+
+import java.util.List;
+import java.util.Map;
+
+/**
+ * Encapsulates methods to calculates errors between centroid and the cluster members.
+ */
+public class Errors {
+
+    public static double sse(Map<Centroid, List<Record>> clustered, Distance distance) {
+        double sum = 0;
+        for (Map.Entry<Centroid, List<Record>> entry : clustered.entrySet()) {
+            Centroid centroid = entry.getKey();
+            for (Record record : entry.getValue()) {
+                double d = distance.calculate(centroid.getCoordinates(), record.getFeatures());
+                sum += Math.pow(d, 2);
+            }
+        }
+
+        return sum;
+    }
+}
@@ -0,0 +1,26 @@
+package com.baeldung.algorithms.kmeans;
+
+import java.util.Map;
+
+/**
+ * Calculates the distance between two items using the Euclidean formula.
+ */
+public class EuclideanDistance implements Distance {
+
+    @Override
+    public double calculate(Map<String, Double> f1, Map<String, Double> f2) {
+        if (f1 == null || f2 == null) {
+            throw new IllegalArgumentException("Feature vectors can't be null");
+        }
+
+        double sum = 0;
+        for (String key : f1.keySet()) {
+            Double v1 = f1.get(key);
+            Double v2 = f2.get(key);
+
+            if (v1 != null && v2 != null) sum += Math.pow(v1 - v2, 2);
+        }
+
+        return Math.sqrt(sum);
+    }
+}
@@ -0,0 +1,236 @@
+package com.baeldung.algorithms.kmeans;
+
+import java.util.ArrayList;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+import java.util.Random;
+import java.util.Set;
+
+import static java.util.stream.Collectors.toList;
+import static java.util.stream.Collectors.toSet;
+
+/**
+ * Encapsulates an implementation of KMeans clustering algorithm.
+ *
+ * @author Ali Dehghani
+ */
+public class KMeans {
+
+    private KMeans() {
+        throw new IllegalAccessError("You shouldn't call this constructor");
+    }
+
+    /**
+     * Will be used to generate random numbers.
+     */
+    private static final Random random = new Random();
+
+    /**
+     * Performs the K-Means clustering algorithm on the given dataset.
+     *
+     * @param records       The dataset.
+     * @param k             Number of Clusters.
+     * @param distance      To calculate the distance between two items.
+     * @param maxIterations Upper bound for the number of iterations.
+     * @return K clusters along with their features.
+     */
+    public static Map<Centroid, List<Record>> fit(List<Record> records, int k, Distance distance, int maxIterations) {
+        applyPreconditions(records, k, distance, maxIterations);
+
+        List<Centroid> centroids = randomCentroids(records, k);
+        Map<Centroid, List<Record>> clusters = new HashMap<>();
+        Map<Centroid, List<Record>> lastState = new HashMap<>();
+
+        // iterate for a pre-defined number of times
+        for (int i = 0; i < maxIterations; i++) {
+            boolean isLastIteration = i == maxIterations - 1;
+
+            // in each iteration we should find the nearest centroid for each record
+            for (Record record : records) {
+                Centroid centroid = nearestCentroid(record, centroids, distance);
+                assignToCluster(clusters, record, centroid);
+            }
+
+            // if the assignment does not change, then the algorithm terminates
+            boolean shouldTerminate = isLastIteration || clusters.equals(lastState);
+            lastState = clusters;
+            if (shouldTerminate) {
+                break;
+            }
+
+            // at the end of each iteration we should relocate the centroids
+            centroids = relocateCentroids(clusters);
+            clusters = new HashMap<>();
+        }
+
+        return lastState;
+    }
+
+    /**
+     * Move all cluster centroids to the average of all assigned features.
+     *
+     * @param clusters The current cluster configuration.
+     * @return Collection of new and relocated centroids.
+     */
+    private static List<Centroid> relocateCentroids(Map<Centroid, List<Record>> clusters) {
+        return clusters
+          .entrySet()
+          .stream()
+          .map(e -> average(e.getKey(), e.getValue()))
+          .collect(toList());
+    }
+
+    /**
+     * Moves the given centroid to the average position of all assigned features. If
+     * the centroid has no feature in its cluster, then there would be no need for a
+     * relocation. Otherwise, for each entry we calculate the average of all records
+     * first by summing all the entries and then dividing the final summation value by
+     * the number of records.
+     *
+     * @param centroid The centroid to move.
+     * @param records  The assigned features.
+     * @return The moved centroid.
+     */
+    private static Centroid average(Centroid centroid, List<Record> records) {
+        // if this cluster is empty, then we shouldn't move the centroid
+        if (records == null || records.isEmpty()) {
+            return centroid;
+        }
+
+        // Since some records don't have all possible attributes, we initialize
+        // average coordinates equal to current centroid coordinates
+        Map<String, Double> average = centroid.getCoordinates();
+
+        // The average function works correctly if we clear all coordinates corresponding
+        // to present record attributes
+        records
+          .stream()
+          .flatMap(e -> e
+            .getFeatures()
+            .keySet()
+            .stream())
+          .forEach(k -> average.put(k, 0.0));
+
+        for (Record record : records) {
+            record
+              .getFeatures()
+              .forEach((k, v) -> average.compute(k, (k1, currentValue) -> v + currentValue));
+        }
+
+        average.forEach((k, v) -> average.put(k, v / records.size()));
+
+        return new Centroid(average);
+    }
+
+    /**
+     * Assigns a feature vector to the given centroid. If this is the first assignment for this centroid,
+     * first we should create the list.
+     *
+     * @param clusters The current cluster configuration.
+     * @param record   The feature vector.
+     * @param centroid The centroid.
+     */
+    private static void assignToCluster(Map<Centroid, List<Record>> clusters, Record record, Centroid centroid) {
+        clusters.compute(centroid, (key, list) -> {
+            if (list == null) {
+                list = new ArrayList<>();
+            }
+
+            list.add(record);
+            return list;
+        });
+    }
+
+    /**
+     * With the help of the given distance calculator, iterates through centroids and finds the
+     * nearest one to the given record.
+     *
+     * @param record    The feature vector to find a centroid for.
+     * @param centroids Collection of all centroids.
+     * @param distance  To calculate the distance between two items.
+     * @return The nearest centroid to the given feature vector.
+     */
+    private static Centroid nearestCentroid(Record record, List<Centroid> centroids, Distance distance) {
+        double minimumDistance = Double.MAX_VALUE;
+        Centroid nearest = null;
+
+        for (Centroid centroid : centroids) {
+            double currentDistance = distance.calculate(record.getFeatures(), centroid.getCoordinates());
+
+            if (currentDistance < minimumDistance) {
+                minimumDistance = currentDistance;
+                nearest = centroid;
+            }
+        }
+
+        return nearest;
+    }
+
+    /**
+     * Generates k random centroids. Before kicking-off the centroid generation process,
+     * first we calculate the possible value range for each attribute. Then when
+     * we're going to generate the centroids, we generate random coordinates in
+     * the [min, max] range for each attribute.
+     *
+     * @param records The dataset which helps to calculate the [min, max] range for
+     *                each attribute.
+     * @param k       Number of clusters.
+     * @return Collections of randomly generated centroids.
+     */
+    private static List<Centroid> randomCentroids(List<Record> records, int k) {
+        List<Centroid> centroids = new ArrayList<>();
+        Map<String, Double> maxs = new HashMap<>();
+        Map<String, Double> mins = new HashMap<>();
+
+        for (Record record : records) {
+            record
+              .getFeatures()
+              .forEach((key, value) -> {
+                  // compares the value with the current max and choose the bigger value between them
+                  maxs.compute(key, (k1, max) -> max == null || value > max ? value : max);
+
+                  // compare the value with the current min and choose the smaller value between them
+                  mins.compute(key, (k1, min) -> min == null || value < min ? value : min);
+              });
+        }
+
+        Set<String> attributes = records
+          .stream()
+          .flatMap(e -> e
+            .getFeatures()
+            .keySet()
+            .stream())
+          .collect(toSet());
+        for (int i = 0; i < k; i++) {
+            Map<String, Double> coordinates = new HashMap<>();
+            for (String attribute : attributes) {
+                double max = maxs.get(attribute);
+                double min = mins.get(attribute);
+                coordinates.put(attribute, random.nextDouble() * (max - min) + min);
+            }
+
+            centroids.add(new Centroid(coordinates));
+        }
+
+        return centroids;
+    }
+
+    private static void applyPreconditions(List<Record> records, int k, Distance distance, int maxIterations) {
+        if (records == null || records.isEmpty()) {
+            throw new IllegalArgumentException("The dataset can't be empty");
+        }
+
+        if (k <= 1) {
+            throw new IllegalArgumentException("It doesn't make sense to have less than or equal to 1 cluster");
+        }
+
+        if (distance == null) {
+            throw new IllegalArgumentException("The distance calculator is required");
+        }
+
+        if (maxIterations <= 0) {
+            throw new IllegalArgumentException("Max iterations should be a positive number");
+        }
+    }
+}
@@ -0,0 +1,144 @@
+package com.baeldung.algorithms.kmeans;
+
+import java.io.IOException;
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.HashMap;
+import java.util.LinkedHashMap;
+import java.util.List;
+import java.util.Map;
+import java.util.Set;
+import java.util.stream.Collectors;
+
+import com.fasterxml.jackson.databind.ObjectMapper;
+import okhttp3.OkHttpClient;
+import retrofit2.Retrofit;
+import retrofit2.converter.jackson.JacksonConverterFactory;
+
+import static java.util.stream.Collectors.toSet;
+
+public class LastFm {
+
+    private static OkHttpClient okHttp = new OkHttpClient.Builder()
+      .addInterceptor(new LastFmService.Authenticator("put your API key here"))
+      .build();
+
+    private static Retrofit retrofit = new Retrofit.Builder()
+      .client(okHttp)
+      .addConverterFactory(JacksonConverterFactory.create())
+      .baseUrl("http://ws.audioscrobbler.com/")
+      .build();
+
+    private static LastFmService lastFm = retrofit.create(LastFmService.class);
+
+    private static ObjectMapper mapper = new ObjectMapper();
+
+    public static void main(String[] args) throws IOException {
+        List<String> artists = getTop100Artists();
+        Set<String> tags = getTop100Tags();
+        List<Record> records = datasetWithTaggedArtists(artists, tags);
+
+        Map<Centroid, List<Record>> clusters = KMeans.fit(records, 7, new EuclideanDistance(), 1000);
+        // Print the cluster configuration
+        clusters.forEach((key, value) -> {
+            System.out.println("------------------------------ CLUSTER -----------------------------------");
+
+            System.out.println(sortedCentroid(key));
+            String members = String.join(", ", value
+              .stream()
+              .map(Record::getDescription)
+              .collect(toSet()));
+            System.out.print(members);
+
+            System.out.println();
+            System.out.println();
+        });
+
+        Map<String, Object> json = convertToD3CompatibleMap(clusters);
+        System.out.println(mapper.writeValueAsString(json));
+    }
+
+    private static Map<String, Object> convertToD3CompatibleMap(Map<Centroid, List<Record>> clusters) {
+        Map<String, Object> json = new HashMap<>();
+        json.put("name", "Musicians");
+        List<Map<String, Object>> children = new ArrayList<>();
+        clusters.forEach((key, value) -> {
+            Map<String, Object> child = new HashMap<>();
+            child.put("name", dominantGenre(sortedCentroid(key)));
+            List<Map<String, String>> nested = new ArrayList<>();
+            for (Record record : value) {
+                nested.add(Collections.singletonMap("name", record.getDescription()));
+            }
+            child.put("children", nested);
+
+            children.add(child);
+        });
+        json.put("children", children);
+        return json;
+    }
+
+    private static String dominantGenre(Centroid centroid) {
+        return centroid
+          .getCoordinates()
+          .keySet()
+          .stream()
+          .limit(2)
+          .collect(Collectors.joining(", "));
+    }
+
+    private static Centroid sortedCentroid(Centroid key) {
+        List<Map.Entry<String, Double>> entries = new ArrayList<>(key
+          .getCoordinates()
+          .entrySet());
+        entries.sort((e1, e2) -> e2
+          .getValue()
+          .compareTo(e1.getValue()));
+
+        Map<String, Double> sorted = new LinkedHashMap<>();
+        for (Map.Entry<String, Double> entry : entries) {
+            sorted.put(entry.getKey(), entry.getValue());
+        }
+
+        return new Centroid(sorted);
+    }
+
+    private static List<Record> datasetWithTaggedArtists(List<String> artists, Set<String> topTags) throws IOException {
+        List<Record> records = new ArrayList<>();
+        for (String artist : artists) {
+            Map<String, Double> tags = lastFm
+              .topTagsFor(artist)
+              .execute()
+              .body()
+              .all();
+
+            // Only keep popular tags.
+            tags
+              .entrySet()
+              .removeIf(e -> !topTags.contains(e.getKey()));
+
+            records.add(new Record(artist, tags));
+        }
+        return records;
+    }
+
+    private static Set<String> getTop100Tags() throws IOException {
+        return lastFm
+          .topTags()
+          .execute()
+          .body()
+          .all();
+    }
+
+    private static List<String> getTop100Artists() throws IOException {
+        List<String> artists = new ArrayList<>();
+        for (int i = 1; i <= 2; i++) {
+            artists.addAll(lastFm
+              .topArtists(i)
+              .execute()
+              .body()
+              .all());
+        }
+
+        return artists;
+    }
+}
@@ -0,0 +1,118 @@
+package com.baeldung.algorithms.kmeans;
+
+import java.io.IOException;
+import java.util.Collections;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+import java.util.Set;
+import java.util.stream.Collectors;
+
+import com.fasterxml.jackson.annotation.JsonAutoDetect;
+import com.fasterxml.jackson.annotation.JsonProperty;
+import okhttp3.HttpUrl;
+import okhttp3.Interceptor;
+import okhttp3.Request;
+import okhttp3.Response;
+import retrofit2.Call;
+import retrofit2.http.GET;
+import retrofit2.http.Query;
+
+import static com.fasterxml.jackson.annotation.JsonAutoDetect.Visibility.ANY;
+import static java.util.stream.Collectors.toList;
+
+public interface LastFmService {
+
+    @GET("/2.0/?method=chart.gettopartists&format=json&limit=50")
+    Call<Artists> topArtists(@Query("page") int page);
+
+    @GET("/2.0/?method=artist.gettoptags&format=json&limit=20&autocorrect=1")
+    Call<Tags> topTagsFor(@Query("artist") String artist);
+
+    @GET("/2.0/?method=chart.gettoptags&format=json&limit=100")
+    Call<TopTags> topTags();
+
+    /**
+     * HTTP interceptor to intercept all HTTP requests and add the API key to them.
+     */
+    class Authenticator implements Interceptor {
+
+        private final String apiKey;
+
+        Authenticator(String apiKey) {
+            this.apiKey = apiKey;
+        }
+
+        @Override
+        public Response intercept(Chain chain) throws IOException {
+            HttpUrl url = chain
+              .request()
+              .url()
+              .newBuilder()
+              .addQueryParameter("api_key", apiKey)
+              .build();
+            Request request = chain
+              .request()
+              .newBuilder()
+              .url(url)
+              .build();
+
+            return chain.proceed(request);
+        }
+    }
+
+    @JsonAutoDetect(fieldVisibility = ANY)
+    class TopTags {
+
+        private Map<String, Object> tags;
+
+        @SuppressWarnings("unchecked")
+        public Set<String> all() {
+            List<Map<String, Object>> topTags = (List<Map<String, Object>>) tags.get("tag");
+            return topTags
+              .stream()
+              .map(e -> ((String) e.get("name")))
+              .collect(Collectors.toSet());
+        }
+    }
+
+    @JsonAutoDetect(fieldVisibility = ANY)
+    class Tags {
+
+        @JsonProperty("toptags") private Map<String, Object> topTags;
+
+        @SuppressWarnings("unchecked")
+        public Map<String, Double> all() {
+            try {
+                Map<String, Double> all = new HashMap<>();
+                List<Map<String, Object>> tags = (List<Map<String, Object>>) topTags.get("tag");
+                for (Map<String, Object> tag : tags) {
+                    all.put(((String) tag.get("name")), ((Integer) tag.get("count")).doubleValue());
+                }
+
+                return all;
+            } catch (Exception e) {
+                return Collections.emptyMap();
+            }
+        }
+    }
+
+    @JsonAutoDetect(fieldVisibility = ANY)
+    class Artists {
+
+        private Map<String, Object> artists;
+
+        @SuppressWarnings("unchecked")
+        public List<String> all() {
+            try {
+                List<Map<String, Object>> artists = (List<Map<String, Object>>) this.artists.get("artist");
+                return artists
+                  .stream()
+                  .map(e -> ((String) e.get("name")))
+                  .collect(toList());
+            } catch (Exception e) {
+                return Collections.emptyList();
+            }
+        }
+    }
+}
@@ -0,0 +1,65 @@
+package com.baeldung.algorithms.kmeans;
+
+import java.util.Map;
+import java.util.Objects;
+
+/**
+ * Encapsulates all feature values for a few attributes. Optionally each record
+ * can be described with the {@link #description} field.
+ */
+public class Record {
+
+    /**
+     * The record description. For example, this can be the artist name for the famous musician
+     * example.
+     */
+    private final String description;
+
+    /**
+     * Encapsulates all attributes and their corresponding values, i.e. features.
+     */
+    private final Map<String, Double> features;
+
+    public Record(String description, Map<String, Double> features) {
+        this.description = description;
+        this.features = features;
+    }
+
+    public Record(Map<String, Double> features) {
+        this("", features);
+    }
+
+    public String getDescription() {
+        return description;
+    }
+
+    public Map<String, Double> getFeatures() {
+        return features;
+    }
+
+    @Override
+    public String toString() {
+        String prefix = description == null || description
+          .trim()
+          .isEmpty() ? "Record" : description;
+
+        return prefix + ": " + features;
+    }
+
+    @Override
+    public boolean equals(Object o) {
+        if (this == o) {
+            return true;
+        }
+        if (o == null || getClass() != o.getClass()) {
+            return false;
+        }
+        Record record = (Record) o;
+        return Objects.equals(getDescription(), record.getDescription()) && Objects.equals(getFeatures(), record.getFeatures());
+    }
+
+    @Override
+    public int hashCode() {
+        return Objects.hash(getDescription(), getFeatures());
+    }
+}
@@ -0,0 +1,49 @@
+package com.baeldung.algorithms.printtriangles;
+
+import org.apache.commons.lang3.StringUtils;
+
+public class PrintTriangleExamples {
+
+    public static String printARightAngledTriangle(int N) {
+        StringBuilder result = new StringBuilder();
+        for (int r = 1; r <= N; r++) {
+            for (int j = 1; j <= r; j++) {
+                result.append("*");
+            }
+            result.append(System.lineSeparator());
+        }
+        return result.toString();
+    }
+
+    public static String printAnIsoscelesTriangle(int N) {
+        StringBuilder result = new StringBuilder();
+        for (int r = 1; r <= N; r++) {
+            for (int sp = 1; sp <= N - r; sp++) {
+                result.append(" ");
+            }
+            for (int c = 1; c <= (r * 2) - 1; c++) {
+                result.append("*");
+            }
+            result.append(System.lineSeparator());
+        }
+        return result.toString();
+    }
+
+    public static String printAnIsoscelesTriangleUsingSubstring(int N) {
+        StringBuilder result = new StringBuilder();
+        String helperString = StringUtils.repeat(' ', N - 1) + StringUtils.repeat('*', N * 2 - 1);
+
+        for (int r = 0; r < N; r++) {
+            result.append(helperString.substring(r, N + 2 * r));
+            result.append(System.lineSeparator());
+        }
+        return result.toString();
+    }
+
+    public static void main(String[] args) {
+        System.out.println(printARightAngledTriangle(5));
+        System.out.println(printAnIsoscelesTriangle(5));
+        System.out.println(printAnIsoscelesTriangleUsingSubstring(5));
+    }
+
+}
@@ -0,0 +1,30 @@
+package com.baeldung.algorithms.stringsortingbynumber;
+
+import java.util.Comparator;
+
+public final class NaturalOrderComparators {
+
+    private static final String DIGIT_AND_DECIMAL_REGEX = "[^\\d.]";
+
+    private NaturalOrderComparators() {
+        throw new AssertionError("Let's keep this static");
+    }
+
+    public static Comparator<String> createNaturalOrderRegexComparator() {
+        return Comparator.comparingDouble(NaturalOrderComparators::parseStringToNumber);
+    }
+
+    private static double parseStringToNumber(String input){
+
+        final String digitsOnly = input.replaceAll(DIGIT_AND_DECIMAL_REGEX, "");
+
+        if("".equals(digitsOnly)) return 0;
+
+        try{
+            return Double.parseDouble(digitsOnly);
+        }catch (NumberFormatException nfe){
+            return 0;
+        }
+    }
+
+}
@@ -0,0 +1,68 @@
+<!DOCTYPE html>
+<meta charset="utf-8">
+<style>
+    .node circle {
+        fill: #fff;
+        stroke: steelblue;
+        stroke-width: 1.5px;
+    }
+
+    .node {
+        font: 10px sans-serif;
+    }
+
+    .link {
+        fill: none;
+        stroke: #ccc;
+        stroke-width: 1.5px;
+    }
+</style>
+<body>
+<script src="http://d3js.org/d3.v3.min.js"></script>
+<script>
+    var diameter = 1100;
+    var tree = d3.layout.tree()
+        .size([360, diameter / 2 - 300])
+        .separation(function (a, b) {
+            return (a.parent == b.parent ? 1 : 2) / a.depth;
+        });
+    var diagonal = d3.svg.diagonal.radial()
+        .projection(function (d) {
+            return [d.y, d.x / 180 * Math.PI];
+        });
+    var svg = d3.select("body").append("svg")
+        .attr("width", diameter)
+        .attr("height", diameter - 150)
+        .append("g")
+        .attr("transform", "translate(" + diameter / 2 + "," + diameter / 2 + ")");
+    d3.json("lastfm.json", function (error, root) {
+        var nodes = tree.nodes(root),
+            links = tree.links(nodes);
+        var link = svg.selectAll(".link")
+            .data(links)
+            .enter().append("path")
+            .attr("class", "link")
+            .attr("d", diagonal);
+        var node = svg.selectAll(".node")
+            .data(nodes)
+            .enter().append("g")
+            .attr("class", "node")
+            .attr("transform", function (d) {
+                return "rotate(" + (d.x - 90) + ")translate(" + d.y + ")";
+            })
+        node.append("circle")
+            .attr("r", 4.5);
+        node.append("text")
+            .attr("dy", ".31em")
+            .attr("text-anchor", function (d) {
+                return d.x < 180 ? "start" : "end";
+            })
+            .attr("transform", function (d) {
+                return d.x < 180 ? "translate(8)" : "rotate(180)translate(-8)";
+            })
+            .text(function (d) {
+                return d.name;
+            });
+    });
+    d3.select(self.frameElement).style("height", diameter - 150 + "px");
+</script>
@@ -0,0 +1,29 @@
+package com.baeldung.algorithms.interpolationsearch;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+import org.junit.Before;
+import org.junit.Test;
+
+public class InterpolationSearchUnitTest {
+    
+    private int[] myData;
+
+    @Before
+    public void setUp() {
+        myData = new int[]{13,21,34,55,69,73,84,101};
+    }
+    
+    @Test
+    public void givenSortedArray_whenLookingFor84_thenReturn6() {
+        int pos = InterpolationSearch.interpolationSearch(myData, 84);
+        assertEquals(6, pos);
+    }
+    
+    @Test
+    public void givenSortedArray_whenLookingFor19_thenReturnMinusOne() {
+        int pos = InterpolationSearch.interpolationSearch(myData, 19);
+        assertEquals(-1, pos);
+    }
+
+}
@@ -0,0 +1,93 @@
+package com.baeldung.algorithms.printtriangles;
+
+import junitparams.JUnitParamsRunner;
+import junitparams.Parameters;
+import org.junit.Test;
+import org.junit.runner.RunWith;
+
+import static org.junit.Assert.assertEquals;
+
+@RunWith(JUnitParamsRunner.class)
+public class PrintTriangleExamplesUnitTest {
+    
+    private static Object[][] rightAngledTriangles() {
+        String expected0 = ""; 
+        
+        String expected2 = "*" + System.lineSeparator() 
+                         + "**" + System.lineSeparator();
+        
+        String expected5 = "*" + System.lineSeparator() 
+                         + "**" + System.lineSeparator()
+                         + "***" + System.lineSeparator()
+                         + "****" + System.lineSeparator()
+                         + "*****" + System.lineSeparator();
+        
+        String expected7 = "*" + System.lineSeparator() 
+                         + "**" + System.lineSeparator()
+                         + "***" + System.lineSeparator()
+                         + "****" + System.lineSeparator()
+                         + "*****" + System.lineSeparator()
+                         + "******" + System.lineSeparator()
+                         + "*******" + System.lineSeparator();
+        
+        return new Object[][] {
+            { 0, expected0 },
+            { 2, expected2 },
+            { 5, expected5 },
+            { 7, expected7 }
+        };
+    }
+
+    @Test
+    @Parameters(method = "rightAngledTriangles")
+    public void whenPrintARightAngledTriangleIsCalled_ThenTheCorrectStringIsReturned(int nrOfRows, String expected) {
+        String actual = PrintTriangleExamples.printARightAngledTriangle(nrOfRows);
+
+        assertEquals(expected, actual);
+    }
+    
+    private static Object[][] isoscelesTriangles() {
+        String expected0 = ""; 
+        
+        String expected2 = " *" + System.lineSeparator() 
+                         + "***" + System.lineSeparator();
+        
+        String expected5 = "    *" + System.lineSeparator() 
+                         + "   ***" + System.lineSeparator()
+                         + "  *****" + System.lineSeparator()
+                         + " *******" + System.lineSeparator()
+                         + "*********" + System.lineSeparator();
+        
+        String expected7 = "      *" + System.lineSeparator() 
+                         + "     ***" + System.lineSeparator()
+                         + "    *****" + System.lineSeparator()
+                         + "   *******" + System.lineSeparator()
+                         + "  *********" + System.lineSeparator()
+                         + " ***********" + System.lineSeparator()
+                         + "*************" + System.lineSeparator();
+        
+        return new Object[][] {
+            { 0, expected0 },
+            { 2, expected2 },
+            { 5, expected5 },
+            { 7, expected7 }
+        };
+    }
+
+    @Test
+    @Parameters(method = "isoscelesTriangles")
+    public void whenPrintAnIsoscelesTriangleIsCalled_ThenTheCorrectStringIsReturned(int nrOfRows, String expected) {
+        String actual = PrintTriangleExamples.printAnIsoscelesTriangle(nrOfRows);
+
+        assertEquals(expected, actual);
+    }
+    
+    @Test
+    @Parameters(method = "isoscelesTriangles")
+    public void whenPrintAnIsoscelesTriangleUsingSubstringIsCalled_ThenTheCorrectStringIsReturned(int nrOfRows, String expected) {
+        String actual = PrintTriangleExamples.printAnIsoscelesTriangleUsingSubstring(nrOfRows);
+
+        assertEquals(expected, actual);
+    }
+
+}
@@ -0,0 +1,79 @@
+package com.baeldung.algorithms.stringsortingbynumber;
+
+import com.baeldung.algorithms.stringsortingbynumber.NaturalOrderComparators;
+import org.junit.Test;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
+
+import static org.junit.Assert.*;
+
+public class NaturalOrderComparatorsUnitTest {
+
+    @Test
+    public void givenSimpleStringsContainingIntsAndDoubles_whenSortedByRegex_checkSortingCorrect() {
+
+        List<String> testStrings = Arrays.asList("a1", "b3", "c4", "d2.2", "d2.4", "d2.3d");
+
+        testStrings.sort(NaturalOrderComparators.createNaturalOrderRegexComparator());
+
+        List<String> expected = Arrays.asList("a1", "d2.2", "d2.3d", "d2.4", "b3", "c4");
+
+        assertEquals(expected, testStrings);
+
+
+    }
+
+    @Test
+    public void givenSimpleStringsContainingIntsAndDoublesWithAnInvalidNumber_whenSortedByRegex_checkSortingCorrect() {
+
+        List<String> testStrings = Arrays.asList("a1", "b3", "c4", "d2.2", "d2.4", "d2.3.3d");
+
+        testStrings.sort(NaturalOrderComparators.createNaturalOrderRegexComparator());
+
+        List<String> expected = Arrays.asList("d2.3.3d", "a1", "d2.2", "d2.4", "b3", "c4");
+
+        assertEquals(expected, testStrings);
+
+
+    }
+
+    @Test
+    public void givenAllForseenProblems_whenSortedByRegex_checkSortingCorrect() {
+
+        List<String> testStrings = Arrays.asList("a1", "b3", "c4", "d2.2", "d2.f4", "d2.3.3d");
+
+        testStrings.sort(NaturalOrderComparators.createNaturalOrderRegexComparator());
+
+        List<String> expected = Arrays.asList("d2.3.3d", "a1", "d2.2", "d2.f4", "b3", "c4");
+
+        assertEquals(expected, testStrings);
+
+
+    }
+
+    @Test
+    public void givenComplexStringsContainingSeparatedNumbers_whenSortedByRegex_checkNumbersCondensedAndSorted() {
+
+        List<String> testStrings = Arrays.asList("a1b2c5", "b3ght3.2", "something65.thensomething5"); //125, 33.2, 65.5
+
+        List<String> expected = Arrays.asList("b3ght3.2", "something65.thensomething5", "a1b2c5" );
+
+        testStrings.sort(NaturalOrderComparators.createNaturalOrderRegexComparator());
+
+        assertEquals(expected, testStrings);
+
+    }
+
+    @Test
+    public void givenStringsNotContainingNumbers_whenSortedByRegex_checkOrderNotChanged() {
+
+        List<String> testStrings = Arrays.asList("a", "c", "d", "e");
+        List<String> expected = new ArrayList<>(testStrings);
+
+        testStrings.sort(NaturalOrderComparators.createNaturalOrderRegexComparator());
+
+        assertEquals(expected, testStrings);
+    }
+}
@@ -5,3 +5,4 @@
 - [Quicksort Algorithm Implementation in Java](https://www.baeldung.com/java-quicksort)
 - [Insertion Sort in Java](https://www.baeldung.com/java-insertion-sort)
 - [Heap Sort in Java](https://www.baeldung.com/java-heap-sort)
+- [Shell Sort in Java](https://www.baeldung.com/java-shell-sort)
@@ -0,0 +1,25 @@
+package com.baeldung.algorithms.inoutsort;
+
+public class InOutSort {
+
+    public static int[] reverseInPlace(int A[]) {
+        int n = A.length;
+        for (int i = 0; i < n / 2; i++) {
+            int temp = A[i];
+            A[i] = A[n - 1 - i];
+            A[n - 1 - i] = temp;
+        }
+
+        return A;
+    }
+
+    public static int[] reverseOutOfPlace(int A[]) {
+        int n = A.length;
+        int[] B = new int[n];
+        for (int i = 0; i < n; i++) {
+            B[n - i - 1] = A[i];
+        }
+
+        return B;
+    }
+}
@@ -0,0 +1,38 @@
+package com.baeldung.algorithms.selectionsort;
+
+public class SelectionSort {
+
+    public static void sortAscending(final int[] arr) {
+        for (int i = 0; i < arr.length - 1; i++) {
+            int minElementIndex = i;
+            for (int j = i + 1; j < arr.length; j++) {
+                if (arr[minElementIndex] > arr[j]) {
+                    minElementIndex = j;
+                }
+            }
+
+            if (minElementIndex != i) {
+                int temp = arr[i];
+                arr[i] = arr[minElementIndex];
+                arr[minElementIndex] = temp;
+            }
+        }
+    }
+
+    public static void sortDescending(final int[] arr) {
+        for (int i = 0; i < arr.length - 1; i++) {
+            int maxElementIndex = i;
+            for (int j = i + 1; j < arr.length; j++) {
+                if (arr[maxElementIndex] < arr[j]) {
+                    maxElementIndex = j;
+                }
+            }
+
+            if (maxElementIndex != i) {
+                int temp = arr[i];
+                arr[i] = arr[maxElementIndex];
+                arr[maxElementIndex] = temp;
+            }
+        }
+    }
+}
@@ -0,0 +1,20 @@
+package com.baeldung.algorithms.shellsort;
+
+public class ShellSort {
+
+    public static void sort(int arrayToSort[]) {
+        int n = arrayToSort.length;
+
+        for (int gap = n / 2; gap > 0; gap /= 2) {
+            for (int i = gap; i < n; i++) {
+                int key = arrayToSort[i];
+                int j = i;
+                while (j >= gap && arrayToSort[j - gap] > key) {
+                    arrayToSort[j] = arrayToSort[j - gap];
+                    j -= gap;
+                }
+                arrayToSort[j] = key;
+            }
+        }
+    }
+}
@@ -0,0 +1,23 @@
+package com.baeldung.algorithms.inoutsort;
+
+import static org.junit.Assert.*;
+import static org.junit.Assert.assertArrayEquals;
+
+import org.junit.Test;
+
+public class InOutSortUnitTest {
+
+    @Test
+    public void givenArray_whenInPlaceSort_thenReversed() {
+        int[] input = {1, 2, 3, 4, 5, 6, 7};
+        int[] expected = {7, 6, 5, 4, 3, 2, 1};
+        assertArrayEquals("the two arrays are not equal", expected, InOutSort.reverseInPlace(input));
+    }
+
+    @Test
+    public void givenArray_whenOutOfPlaceSort_thenReversed() {
+        int[] input = {1, 2, 3, 4, 5, 6, 7};
+        int[] expected = {7, 6, 5, 4, 3, 2, 1};
+        assertArrayEquals("the two arrays are not equal", expected, InOutSort.reverseOutOfPlace(input));
+    }
+}
@@ -0,0 +1,25 @@
+package com.baeldung.algorithms.selectionsort;
+
+import static org.junit.Assert.*;
+import static org.junit.Assert.assertArrayEquals;
+
+import org.junit.Test;
+
+public class SelectionSortUnitTest {
+
+    @Test
+    public void givenUnsortedArray_whenSelectionSort_SortAscending_thenSortedAsc() {
+        int[] input = { 5, 4, 1, 6, 2 };
+        SelectionSort.sortAscending(input);
+        int[] expected = {1, 2, 4, 5, 6};
+        assertArrayEquals("the two arrays are not equal", expected, input);
+    }
+    
+    @Test
+    public void givenUnsortedArray_whenSelectionSort_SortDescending_thenSortedDesc() {
+        int[] input = { 5, 4, 1, 6, 2 };
+        SelectionSort.sortDescending(input);
+        int[] expected = {6, 5, 4, 2, 1};
+        assertArrayEquals("the two arrays are not equal", expected, input);
+    }
+}
@@ -0,0 +1,17 @@
+package com.baeldung.algorithms.shellsort;
+
+import static org.junit.Assert.*;
+import static org.junit.Assert.assertArrayEquals;
+
+import org.junit.Test;
+
+public class ShellSortUnitTest {
+
+    @Test
+    public void givenUnsortedArray_whenShellSort_thenSortedAsc() {
+        int[] input = {41, 15, 82, 5, 65, 19, 32, 43, 8};
+        ShellSort.sort(input);
+        int[] expected = {5, 8, 15, 19, 32, 41, 43, 65, 82};
+        assertArrayEquals("the two arrays are not equal", expected, input);
+    }
+}
--- a/Show More
+++ b/Show More