Kategorie: abstrakte algorithmen

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 …

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 …

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 …

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 …

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 …