Übersetzung für 'sort algorithm' von Englisch nach Deutsch

sort algorithm

Sortieralgorithmus {m}comp.

---

Broyden-Fletcher-Goldfarb-Shanno algorithm <BFGS algorithm>

Broyden-Fletcher-Goldfarb-Shanno-Algorithmus {m} <BFGS-Algorithmus>comp.math.

Werbung

ant colony optimization algorithm <ACO algorithm>

Ameisenalgorithmus {m}comp.math.spec.

Knuth-Morris-Pratt algorithm <KMP algorithm>

Knuth-Morris-Pratt-Algorithmus {m}comp.

branch and bound algorithm <BB algorithm>

Branch-and-Bound-Algorithmus {m} <BB- / B&B-Algorithmus> [Verzweigung und Schranke]

Jukes-Cantor algorithm <JC algorithm>

Jukes-Cantor-Algorithmus {m}biol.

estimation-maximization algorithm <EM algorithm>

EM-Algorithmus {m}math.stat.

algorithm

Rechenregel {f}

Rechenanweisung {f}math.

Algorithmus {m}comp.math.

Verfahren {n}math.

sorting algorithm

Sortieralgorithmus {m}comp.

nondeterministic algorithm

nichtdeterministischer Algorithmus {m}comp.

approximation algorithm

Approximationsalgorithmus {m}comp.

verification algorithm

Verifikationsalgorithmus {m}comp.

Nussinov algorithm

Nussinov-Algorithmus {m}biol.math.

greedy algorithm

Greedy-Verfahren {n}stat.

eigenvalue algorithm

Eigenwert-Algorithmus {m} [auch: Eigenwertalgorithmus]math.

FASTA algorithm

FASTA-Algorithmus {m}biol.

eigenvector algorithm

Eigenvektor-Algorithmus {m}math.

BLAST algorithm

BLAST-Algorithmus {m}biol.comp.

• Heapsort primarily competes with quicksort, another very efficient general purpose in-place comparison-based sort algorithm.
• The algorithm uses heuristic tests to determine whether each bin would be more efficiently sorted by spreadsort or some other classical sort algorithm, then recursively sorts the bin.
• Kendall tau distance is also called bubble-sort distance since it is equivalent to the number of swaps that the bubble sort algorithm would take to place one list in the same order as the other list.
• Most languages provide a generic sort function that implements a sort algorithm that will sort arbitrary objects.
• One example of external sorting is the external merge sort algorithm, which is a K-way merge algorithm. It sorts chunks that each fit in RAM, then merges the sorted chunks together.

• The painter’s algorithm (also depth-sort algorithm and priority fill) is an algorithm for visible surface determination in 3D computer graphics that works on a polygon-by-polygon basis rather than a pixel-by-pixel, row by row, or area by area basis of other Hidden Surface Removal algorithms.
• If we limit the set of algorithms to a specific family (for instance, all deterministic choices for pivots in the quick sort algorithm), choosing an algorithm A from R is equivalent to running a randomized algorithm (for instance, running quick sort and randomly choosing the pivots at each step).
• Pseudocode for top-down merge sort algorithm which recursively divides the input list into smaller sublists until the sublists are trivially sorted, and then merges the sublists while returning up the call chain.
• The Stockham auto-sort algorithm performs every stage of the FFT out-of-place, typically writing back and forth between two arrays, transposing one "digit" of the indices with each stage, and has been especially popular on SIMD architectures.
• A very simple random sort algorithm was proved by Sunter in 1977.

• , as part of a variant heap sort algorithm that (unlike the standard heap sort using binary heaps) could be used to sort [...] items using only [...] comparisons.