Pfadfindung: Dijkstra-Algorithmus
One of the best known and, above all, most efficient algorithms for determining the shortest path between two points on a graph is Dijkstra’s algorithm. It is typically formulated to …
Enthusiastischer Backend-Entwickler
One of the best known and, above all, most efficient algorithms for determining the shortest path between two points on a graph is Dijkstra’s algorithm. It is typically formulated to …
Overview Lean is a production methodology intended to minimise waste and optimise efficiency, from conceptualisation to product delivery. Originally pioneered by Toyota in manufacturing, Lean principles have been adapted to …
Background In order to successfully implement a large software project, it is crucial that all developers adhere to a structured model for progressing. These models are known as project management …
Computer vision is a branch of artificial intelligence that deals with the machine interpretation of images. Roughly speaking, it is about giving machines an understanding of environments and objects. According …
General Information The very pragmatically and aptly named sorting algorithm QuickSort is one of the most time-efficient algorithms in its category. Its strength lies in the concept of divide and …
When confronted with a maze and there is the possibility of leaving markings in some way, the Trémaux algorithm is suitable. The underlying process is essentially easy to understand using …
Bubble-Sort is an easy to understand, but mostly inefficient (time complexity O(n2)) approach to sorting values of a list by order of magnitude. It is rarely used in practice, at …
There are almost countless different approaches to achieving a programming goal. In general, a distinction is made between iterative and recursive programming styles. The procedural style will not be covered, …
The expression “Race Condition” is used to refer to a state in which multiple processes of a system execute in parallel, whereby a strict adherence to a particular order of …
With multithreaded (parallel execution) or asynchronous programmes, there is a risk of a system entering a blocked state. A deadlock describes such a state in which several processes are waiting …