The following is a list of well-known algorithms.
Berikut adalah daftar algoritme.
Sometimes called dictionary search or interpolated search.
Kadang-kadang disebut pencarian kamus atau pencarian interpolasi.
Variants: Canonical LR parser LALR (look-ahead LR) parser Operator-precedence parser Simple LR parser Simple precedence parser Packrat parser: a linear time parsing algorithm supporting some context-free grammars and parsing expression grammars Pratt parser Recursive descent parser: a top-down parser suitable for LL(k) grammars Shunting-yard algorithm:
Variants: Operator-precedence parser SLR (Simple LR) parser LALR (Look-ahead LR) parser Canonical LR parser Packrat parser: A linear time parsing algorithm supporting some context-free grammars and parsing expression grammars CYK algorithm: An O(n3) algorithm for parsing any context-free grammar Earley's algorithm: Another O(n3) algorithm for parsing any context-free grammar Algorithms for Recovery and Isolation Exploiting Semantics: recovery Unicode Collation Algorithm CHS conversion: Converting between disk addressing systems Cyclic redundancy check: calculation of a check word Parity: Simple/fast error detection technique.
Optimizes Huffman coding subject to a length restriction on code strings Shannon–Fano coding Shannon–Fano–Elias coding: precursor to arithmetic encoding Entropy coding with known entropy characteristics Golomb coding: form of entropy coding that is optimal for alphabets following geometric distributions Rice coding: form of entropy coding that is optimal for alphabets following geometric distributions Truncated binary encoding Unary coding: code that represents a number n with n ones followed by a zero Universal codes: encodes positive integers into binary code words Elias delta, gamma, and omega coding Exponential-Golomb coding Fibonacci coding Levenshtein coding Fast Efficient & Lossless Image Compression System (FELICS): a lossless image compression algorithm Incremental encoding: delta encoding applied to sequences of strings Prediction by partial matching (PPM): an adaptive statistical data compression technique based on context modeling and prediction Run-length encoding: lossless data compression taking advantage of strings of repeated characters SEQUITUR algorithm:
Entropy encoding: coding scheme that assigns codes to symbols so as to match code lengths with the probabilities of the symbols Huffman coding: simple lossless compression taking advantage of relative character frequencies Adaptive Huffman coding: adaptive coding technique based on Huffman coding Arithmetic coding: advanced entropy coding Range encoding: data compression method that is believed to approach the compression ratio of arithmetic coding Entropy coding with known entropy characteristics Unary coding: code that represents a number n with n ones followed by a zero Elias delta|gamma|omega coding: universal code encoding the positive integers Fibonacci coding: universal code which encodes positive integers into binary code words Golomb coding: form of entropy coding that is optimal for alphabets following geometric distributions Rice coding: form of entropy coding that is optimal for alphabets following geometric distributions Linear predictive coding: lossy compression by representing the spectral envelope of a digital signal of speech in compressed form A-law algorithm: