more and more
Find Substrings That Are Palindromes in Java 1. Overview In this quick tutorial, we’ll go through different approaches to finding all substrings within a given string that are palindromes. We’ll also note the time complexity of each approach. 2. Brute Force Approach In this approach, we’ll simply iterate over the… Continue Reading java-palindrome-substrings
getdocs
Quicksort Algorithm Implementation in Java 1. Overview In this tutorial, we’ll explore the QuickSort algorithm in detail, focusing on its Java implementation. We’ll also discuss its advantages and disadvantages and then analyze its time complexity. 2. QuickSort Algorithm Quicksort is a sorting algorithm, which is leveraging the divide-and-conquer principle. It has… Continue Reading java-quicksort
getdocs
Dijkstra Shortest Path Algorithm in Java 1. Overview The emphasis in this article is the shortest path problem (SPP), being one of the fundamental theoretic problems known in graph theory, and how the Dijkstra algorithm can be used to solve it. The basic goal of the algorithm is to determine… Continue Reading java-dijkstra
getdocs
Counting Words in a String 1. Overview In this tutorial, we are going to go over different ways of counting words in a given string using Java. 2. Using StringTokenizer A simple way to count words in a string in Java is to use the StringTokenizer class: assertEquals(3, new StringTokenizer(“three… Continue Reading java-word-counting
getdocs
How an In-Place Sorting Algorithm Works 1. Introduction In this tutorial, we’ll explain how the in-place sorting algorithm works. 2. In-Place Algorithms The in-place algorithms are those that don’t need any auxiliary data structure in order to transform the input data. Basically, it means that the algorithm doesn’t use extra… Continue Reading java-in-place-sorting
getdocs
Design a Genetic Algorithm in Java 1. Introduction The aim of this series is to explain the idea of genetic algorithms. Genetic algorithms are designed to solve problems by using the same processes as in nature — they use a combination of selection, recombination, and mutation to evolve a solution… Continue Reading java-genetic-algorithm
getdocs
Looping Diagonally Through a 2d Java Array 1. Overview In this tutorial, we will see how to loop diagonally through a two-dimensional array. The solution that we provide can be used for a square two-dimensional array of any size. 2. Two-Dimensional Array The key in working with elements of an… Continue Reading java-loop-diagonal-array
getdocs
The Traveling Salesman Problem in Java Algorithms Java 1. Introduction In this tutorial, we’ll learn about the Simulated Annealing algorithm and we’ll show the example implementation based on the Traveling Salesman Problem (TSP). 2. Simulated Annealing The Simulated Annealing algorithm is a heuristic for solving the problems with a large… Continue Reading java-simulated-annealing-for-traveling-salesman
getdocs
Radix Sort in Java Algorithms Java 1. Introduction In this tutorial, we’ll learn about Radix Sort, analyze its performance, and take a look at its implementation. Here we focus on using Radix Sort to sort integers, but it’s not limited to just numbers. We can use it to sort other… Continue Reading java-radix-sort
getdocs
Check If Two Rectangles Overlap In Java 1. Overview In this quick tutorial, we’ll learn to solve an algorithmic problem of checking whether the two given rectangles overlap. We’ll start by looking at the problem definition and then progressively build up a solution. Finally, we’ll implement it in Java. 2.… Continue Reading java-check-if-two-rectangles-overlap
getdocs