Become a Better Programmer!

How does the Floyd-Warshall algorithm work, and when do you use it? What are its variants? How to determine its time complexity?

Do you, at some point, no longer want to work as an employee? But rather self-employed or even as a solopreneur or entrepreneur? Here, you'll find some excellent books on management, entrepreneurship, leadership, and startups.

As a software developer, especially a freelancer, it is vitable to be able to market yourself well. In this article, I'll introduce you to some great books on online marketing / internet marketing.

In this article, I present some great books on personal development, personal growth, health, career development, negotiations, and financial education.

In this article I introduce you to some great books on productivity, personal development, career development, and financial educationentrepreneurship and online marketing.

In this article, I'll show you how to install several Java versions simultaneously in Windows and how to switch between them on the command line with short commands.

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?