the maxn algorithm is an algorithm that finds an equilibrium point for a search tree to favor a specific player in n-player games. The algorithm was designed...

It is a divide-and-conquer algorithm that reduces the multiplication of two n-digit numbers to three multiplications of n/2-digit numbers and, by repeating...

every algorithm must at least scan the array once which already takes O(n) time named MaxEndingHere in Bentley (1989), and c in Gries (1982) named MaxSoFar...

algorithm was developed independently by Joel Max and published in 1960, which is why the algorithm is sometimes referred as the Lloyd-Max algorithm....

algorithm or Munkres assignment algorithm. The time complexity of the original algorithm was O ( n 4 ) {\displaystyle O(n^{4})} , however Edmonds and Karp...

with d ≤ n {\displaystyle d\leq n} , the LLL algorithm calculates an LLL-reduced (short, nearly orthogonal) lattice basis in time O ( d 5 n log 3 ⁡ B...

with no quadratic worst-case scenarios. Selection algorithms: A heap allows access to the min or max element in constant time, and other selections (such...

The Needleman–Wunsch algorithm is an algorithm used in bioinformatics to align protein or nucleotide sequences. It was one of the first applications of...

keys are called max-heaps; those where it is less than or equal to (≤) are called min-heaps. Efficient (logarithmic time) algorithms are known for the...

Ford–Fulkerson algorithm (FFA) is a greedy algorithm that computes the maximum flow in a flow network. It is sometimes called a "method" instead of an "algorithm" as...