lihat juga daftar struktur data, daftar topik umum algoritma, dan daftar istilah yang berhubungan dengan algoritma dan struktur data.
algoritma kombinatorial umum
algoritma pencari-siklus floyd: iterasi untuk mencari siklus dalam barisan/sekuens
(uniformly distributed) pseudorandom number generators:
blum blum shub
robinson-schensted algorithm: korespondensi dan pasangan yang bijetif dari young tableaux yang standar
algoritma bellman-ford: menghitung jarak terpendek pada graf berbobot, di mana sisi bisa memiliki bobot negatif
algoritma dijkstra: menghitung jarak terpendek pada graf berbobot, tanpa sisi berbobot negatif.
algoritma floyd-warshall: menghitung solusi jarak terpendek untuk semua pasang titik pada sebuah graf berarah dan berbobot
algoritma kruskal: mencari pohon rentang minimum pada sebuah graf
algoritma prim: mencari pohon rentang minimum pada sebuah graf
algoritma boruvka: mencari pohon rentang minimum pada sebuah graf
algoritma ford-fulkerson: menghitung aliran maksimal di dalam graf
algoritma edmonds-karp: implementasi dari ford-fulkerson
nonblocking minimal spanning switch say, for a telephone exchange
spring based algorithm: algoritma untuk penggambaran draf
algoritma hungaria: algorithm for finding a perfect matching
pencarian linear: mencari sebuah item pada sebuah list tak berurut
algoritma seleksi: mencari item ke-k pada sebuah list
pencarian biner: menemukan sebuah item pada sebuah list terurut
pohon pencarian biner
pencarian breadth-first: menelusuri sebuah graf tingkatan demi tingkatan
pencarian depth-first: menelusuri sebuah graf cabang demi cabang
pencarian best-first: menelusuri sebuah graf dengan urutan sesuai kepentingan dengan menggunakan antrian prioritas
pencarian pohon a*: kasus khusus dari pencarian best-first
pencarian prediktif: pencarian mirip biner dengan faktor pada magnitudo dari syarat pencarian terhadap nilai atas dan bawah dalam pencarian.
kadang-kadang disebut pencarian kamus atau pencarian interpolasi.
tabel hash: mencari sebuah item dalam sebuah kumpulan tak berurut dalam waktu o(1).
algoritma brute force
levenshtein edit distance
binary tree sort
bubble sort: untik setiap pasangan, tukar item tersebut
heapsort: mengubah list menjadi heap, lalu pindah yang terbesar kepada daftar.
insertion sort: menentukan dimana item tertentu termasuk dalam list yang ter-urut, dan menyisipkan padanya
merge sort: pisah daftar menjadi pasangan dua-dua, urutkan lalu digabung dengan satu pasangan lainnya, kembali diurutkan, dan diulang hingga menjadi daftar utuh
quicksort: pisah daftar menjadi dua daftar, yang satu lebih rendah yang satu lebih besar, dan urut terpisah.
radix sort: sorts strings letter by letter
selection sort: pick the smallest of the remaining elements, add it to the end of the sorted list
shell sort: an attempt to improve insertion sort
kompresi data tanpa kehilangan
burrows-wheeler transform: preprocessing useful for improving lossless compression
deflate: lossless data compression
delta encoding: aid to compression of data in which sequential data occurs frequently
incremental encoding: delta encoding applied to sequences of strings
lzw: singkatan dari (lempel-ziv-welch)
lz77 (algorithm): lz77 and lz78 are the names for the two lossless data compression algorithms
lzma: singkatan dari lempel-ziv-markov chain-algorithm
lzo: pemadatan data yang cepat
ppm compression algorithm
truncated binary encoding
run-length encoding: pemadatan data yang menggunakan deretan huruf yang berulang.
sequitur algorithm: lossless compression by incremental grammar inference on a string
ezw (embedded zerotree wavelet)
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 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
kompresi data berkehilangan
linear predictive coding: lossy compression by representing the spectral envelope of a digital signal of speech in compressed form
a-law algorithm: standard companding algorithm
mu-law algorithm: standard analog signal compression or companding algorithm
fractal compression: method used to compress images using fractals
transform coding: type of data compression for "natural" data like audio signals or photographic images
vector quantization: technique often used in lossy data compression
wavelet compression: form of data compression well suited for image compression (sometimes also video compression and audio compression)
gift wrapping algorithm: determining the convex hull of a set of points
graham scan determining the convex hull of a set of points in the plane
point in polygon: tests whether a given point lies within a given polygon
bresenham's line algorithm: plots points of a 2-dimensional array to form a straight line between 2 specified points (uses decision variables)
dda line algorithm: plots points of a 2-dimensional array to form a straight line between 2 specified points (uses floating-point math)
flood fill: fills a connected region of a multi-dimensional array with a specified symbol
painter's algorithm: detects visible parts of a 3-dimensional scenery
ray tracing: realistic image rendering
lihat juga topik dalam kriptografi
enkripsi simetris dengan kata kunci:
advanced encryption standard (aes), pemenang kompetisi nist pada tahun 2000
data encryption standard (des), pemenang kompetisi nbs (sekarang nist), telah digantikan dengan aes.
enkripsi asimetris dengan kunci publik atau tanda tangan digital:
diffie-hellman key exchange
cryptographic message digest functions:
md5  sekarang ini sudah terdapat algoritma yang mampu memalsukan jumlah md5.
presentasi pemalsuan jumlah md5
hmac: keyed-hash message authentication
perhitungan nomor acak tentu yang aman untuk persandian (cryptographically secure pseudo-random number generator)
blum blum shub - berdasarkan faktorisasi prima.
fortuna, allegedly an improvement on yarrow
diffie-hellman: key exchange
algoritma distributed systems
lamport ordering: a partial ordering of events based on the happened-before relation
snapshot algorithm: a snapshot is the process of recording the global state of a system
vector ordering: a total ordering of events
see also main article numerical analysis and list of numerical analysis topics
algoritma de boor: computes splines.
algoritma de casteljau: melakukan perhitungan kurva bzier
false position method: approximates roots of a function
gauss-jordan elimination: solves systems of linear equations
algoritma gauss-legendre: computes the digits of pi
gauss-newton algorithm: find minimum of function of several variables
penambahan kahan: menambahkan bilangan-bilangan titik mengambang dengan ketelitian lebih
levenberg-marquardt algorithm: find minimum of function of several variables
miser algorithm: monte carlo simulation, numerical integration
newton's method: finds zeros of functions with calculus
pembulatan: membulatkan bilangan pecah
secant method: approximates roots of a function
shifting nth-root algorithm: digit by digit root extraction
akar persegi: menghitungkan akar persegi dengan ketelitian terbatas
simplex algorithm: an algorithm for solving the linear programming problem
branch and bound
digital signal processing
cordic: fast trigonometric function computation technique.
fast fourier transform: determines the frequencies contained in a (segment of a) signal
cooley-tukey fft algorithm
rainflow-counting algorithm: reduces a complex stress history to a count of elementary stress-reversals for use in fatigue analysis
osem: algorithm for processing of medical images
goertzel algorithm can be used for dtmf digit decoding.
[[discrete fourier transformfrequency domain ica** rader's fft algorithm
bluestein's fft algorithm
number theoretic algorithms
pollard's rho algorithm for logarithms
index calculus algorithm
euclidean algorithm: computes the greatest common divisor
faktorisasi prima: pemecahan bilangan bulat menjadi faktor prima.
faktorisasi kurva eliptik lenstra
pollard's rho algorithm
pollard's p-1 algorithm
congruence of squares
special number field sieve
general number field sieve
jones's period proxy algorithm
algoritma perkalian: cara perkalian dua bilangan yang cepat.
ujian bilangan prima: menentukan apakah suatu bilangan adalah bilangan prima.
aks primality test
miller-rabin primality test
sieve of eratosthenes
sieve of atkin
buchberger's algorithm: finds a grbner basis
exponentiating by squaring: quickly computes powers of numbers and matrices
gram-schmidt process: orthogonalizes a set of vectors
knuth-bendix completion algorithm: for rewriting rule systems
multivariate division algorithm: for polynomials in several indeterminates
recursive descent parser: a top-down parser suitable for ll(k) grammars
ll parser: a relatively simple linear time parsing algorithm for a limited class of context-free grammars
lr parser: a more complex linear time parsing algorithm for a larger class of context-free grammars.
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
teknik perangkat lunak
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.
is a number even or odd?
diff: compare two sequences.
an example of dynamic programming (dynamic refers to the property that the optimal solution can be constructed by combining optimal solutions to sub-problems e.g. quicksort).
application of quantum computation to various categories of problems and algorithms
grover's algorithm: provides quadratic speedup for many search problems
shor's algorithm: provides exponential speedup for factorizing a number
deutsch-jozsa algorithm: criterion of balance for boolean function
texas medication algorithm project
doomsday algorithm: day of the week
levenberg-marquardt nonlinear least squares fitting algorithm
marzullo's algorithm: distributed clock synchronization
page replacement algorithms
penukaran xor: menukar nilainya dua variabel tanpa menggunakan variabel sementara
algoritma penggantian halaman