How does the Bellman-Ford algorithm work, and when to use it? Where do negative edge weights occur in practice? How do you determine the time complexity of Bellman-Ford?
How does the A* algorithm work and how does it differ from Dijkstra's algorithm? How to implement A* in Java? How to determine its time complexity?
How does Dijkstra's algorithm work? How to implement the Dijkstra algorithm in Java? How to determine its time complexity?
What is the difference between "Shortest Path" and "Pathfinding"? Which shortest path algorithms are there?
Labyrinth algorithm: How to find the shortest path between two points in a labyrinth?
The best and most interesting biographies of the tech industry to read: Steve Jobs, Jeff Bezos, Elon Musk.
How to compare two objects in Java? What is the difference between Comparator and Comparable? How to create a Comparator with Java 8?
All sorting methods presented so far are based on the comparison of two elements on smaller, larger or equal. You will learn that there are also so-called non-comparison-based sorting methods in this article about Counting Sort.
In this article, I'll show you that Heapsort has nothing to do with the Java heap. I'll show how it works, its Java source code, and I'll explain how to determine its time complexity.
This article describes how Merge Sort works, shows its Java source code and explains how to determine its time complexity.
This article describes how Quicksort works, shows the Java source code and explains how to determine its time complexity.