Pathfinding: Dijkstra’s Algorithm
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 …
Sorting algorithm: QuickSort
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 …
Sorting algorithm: Bubble-Sort
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 …
Notation styles: Iterative and Recursive
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, …
Bugs: Race Condition
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 …
Bug: Dead Lock
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 …
Data format: JSON
Data is transferred between computers in various ways, whereby standardised data formats are required for comprehensible communication. This usually requires both parties to use the same medium (speech), the same …
Text in binary: ASCII
The use of the binary system in digital systems is as old as the invention of the computer. Texts are stored on computers as bit sequences (1 and 0) and …
Search Strategy: Binary Search
Binary search is considered to be one of the fastest search algorithms. Given a sorted data collection of ordinally (order of magnitude) distinguishable values, the algorithm requires at most half …
Heap’s Algorithm – Generation of Permutations
Definition of Permutation The term “permutation” refers to a possible arrangement of elements. All permutations of a list represent different ways in which the elements can be ordered. The number …
EN 
DE