Wagner-Fischer (Edit Distance)
The Wagner-Fischer algorithm is a dynamic programming algorithm to determine the (minimum) edit distance between two strings.
No results
The Wagner-Fischer algorithm is a dynamic programming algorithm to determine the (minimum) edit distance between two strings.
Quicksort is a fast divide-and-conquer algorithm for sorting tasks. It works recursively and in-place.
Strict-Alternation is turn-based algorithm to solve the mutual exclusion problem.
Binary search is an algorithm to find a given element within a sorted array.
Fisher's protocol is an algorithm to solve the mutual exclusion problem.
Mergesort is a recursive sorting algorithm based on divide and conquer principle.
Kadane's algorithm solves the maximum-subarray-problem, where the task is finding the contiguous subarray with maximal sum.
Alpha-Beta search is an advanced version of the Minimax algorithm, where the best possible score in a game after players get to move a certain number of times is determined.
The Minimax algorithm determines the best score in a game after players get to move a certain number of times.