Lompat ke isi

Daftar algoritme: Perbedaan antara revisi

Dari Wikipedia bahasa Indonesia, ensiklopedia bebas
Jelajahi riwayat secara interaktif
← Revisi sebelumnya
Konten dihapus Konten ditambahkan
VisualTeks wiki
Borgxbot (bicara | kontrib)
259.487 suntingan
k Robot: Cosmetic changes
Wagino Bot (bicara | kontrib)
Bot
4.157.822 suntingan
k →‎Referensi: Bot: Merapikan artikel, removed stub tag
 
(43 revisi perantara oleh 27 pengguna tidak ditampilkan)
Baris 1: Baris 1:
{{terjemah|Inggris}}
{{terjemah|Inggris}}
Berikut adalah '''daftar [[algoritma]]'''.
Berikut adalah '''daftar [[algoritme]]'''.


''Lihat juga [[daftar struktur data]], [[daftar topik umum algoritma]], dan [[daftar istilah yang berhubungan dengan algoritma dan struktur data]].''
''Lihat juga [[daftar struktur data]], [[daftar topik umum algoritme]], dan [[daftar istilah yang berhubungan dengan algoritme dan struktur data]].''


== Algoritma kombinatorial ==
== Algoritme kombinatorial ==


=== Algoritma kombinatorial umum ===
=== Algoritme kombinatorial umum ===


* [[Algoritma pencari-siklus Floyd]]: iterasi untuk mencari siklus dalam barisan/sekuens
* [[Algoritme pencari-siklus Floyd]]: iterasi untuk mencari siklus dalam barisan/sekuens
* (uniformly distributed) [[Pseudorandom number generator]]s:
* (uniformly distributed) [[Pseudorandom number generator]]s:
** [[Blum Blum Shub]]
** [[Blum Blum Shub]]
** [[Mersenne twister]]
** [[Mersenne twister]]
* [[Robinson-Schensted algorithm]]: generates permutations from pairs of [[Young tableaux]]
* [[Robinson-Schensted algorithm]]: korespondensi dan pasangan yang bijetif dari [[Young tableaux]] yang standar


=== Algoritma graph ===
=== Algoritme graf ===
{{utama|Teori graph}}
{{utama|Teori graf}}


* [[Algoritma Bellman-Ford]]: menghitung [[jarak terpendek]] pada graf berbobot, di mana sisi bisa memiliki bobot negatif
* [[Algoritme 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.
* [[Algoritme 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
* [[Algoritme 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
* [[Algoritme Kruskal]]: mencari [[pohon rentang minimum]] pada sebuah graf
* [[Algoritma Prim]]: mencari [[pohon rentang minimum]] pada sebuah graf
* [[Algoritme Prim]]: mencari [[pohon rentang minimum]] pada sebuah graf
* [[Algoritma Boruvka]]: mencari [[pohon rentang minimum]] pada sebuah graf
* [[Algoritme Boruvka]]: mencari [[pohon rentang minimum]] pada sebuah graf
* [[Algoritma Ford-Fulkerson]]: computes the [[maximum flow problem|maximum flow]] in a graph
* [[Algoritme Ford-Fulkerson]]: menghitung [[maximum flow problem|aliran maksimal]] di dalam graf
* [[Algoritma Edmonds-Karp]]: implementation of Ford-Fulkerson
* [[Algoritme Edmonds-Karp]]: implementasi dari Ford-Fulkerson
* [[Nonblocking Minimal Spanning Switch]] say, for a [[telephone exchange]]
* [[Nonblocking Minimal Spanning Switch]] say, for a [[telephone exchange]]
* [[Spring based algorithm]]: algorithm for [[graph drawing]]
* [[Spring based algorithm]]: algoritme untuk [[graph drawing|penggambaran draf]]
* [[Topological sorting|Topological sort]]
* [[Topological sorting|Topological sort]]
* [[Algoritma Hungaria]]: algorithm for finding a perfect [[matching]]
* [[Algoritme Hungaria]]: algorithm for finding a perfect [[matching]]


=== [[Algoritma pencarian]] ===
=== [[Algoritme pencarian]] ===


* [[Pencarian linear]]: mencari sebuah item pada sebuah list tak berurut
* [[Pencarian linear]]: mencari sebuah item pada sebuah list tak berurut
* [[Algoritma seleksi]]: mencari item ke-''k'' pada sebuah list
* [[Algoritme seleksi]]: mencari item ke-''k'' pada sebuah list
* [[Pencarian biner]]: menemukan sebuah item pada sebuah list terurut
* [[Pencarian biner]]: menemukan sebuah item pada sebuah list terurut
* [[Pohon Pencarian Biner]]
* [[Pohon Pencarian Biner]]
Baris 39: Baris 39:
* [[Pencarian Depth-first]]: menelusuri sebuah graf cabang demi cabang
* [[Pencarian Depth-first]]: menelusuri sebuah graf cabang demi cabang
* [[Pencarian Best-first]]: menelusuri sebuah graf dengan urutan sesuai kepentingan dengan menggunakan [[antrian prioritas]]
* [[Pencarian Best-first]]: menelusuri sebuah graf dengan urutan sesuai kepentingan dengan menggunakan [[antrian prioritas]]
* [[Algoritma Pencarian A Bintang|Pencarian pohon A*]]: kasus khusus dari pencarian best-first
* [[Algoritme Pencarian A Bintang|Pencarian pohon A*]]: kasus khusus dari pencarian best-first
* [[Pencarian Interpolasi|Pencarian Prediktif]]: pencarian mirip biner dengan faktor pada [[magnitudo (matematika)|magnitudo]] dari syarat pencarian terhadap nilai atas dan bawah dalam pencarian. Kadang-kadang disebut pencarian kamus atau pencarian interpolasi.
* [[Pencarian Interpolasi|Pencarian Prediktif]]: pencarian mirip biner dengan faktor pada [[magnitudo (matematika)|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).
* [[Tabel Hash]]: mencari sebuah item dalam sebuah kumpulan tak berurut dalam waktu O(1).


=== String algorithms ===
=== Algoritme string ===
==== [[String searching algorithm|Searching]] ====
==== [[Algoritme pencarian string|Pencarian]] ====
* [[Algoritme pencarian string#Algoritme brute force dalam pencarian string|Algoritme brute force]]
*[[Algoritma Aho-Corasick]]
*[[Algoritma Bitap]]
* [[Algoritme Aho-Corasick]]
*[[Boyer-Moore string search algorithm]]
* [[Algoritme Boyer-Moore]]
*[[Knuth-Morris-Pratt algorithm]]
* [[Algoritme Knuth-Morris-Pratt]]
* [[Algoritme Karp-Rabin]]
*[[Rabin-Karp string search algorithm]]


==== Approximate matching ====
==== Pencocokan string ====
* [[Algoritme Bitap]]
*[[Levenshtein distance|Levenshtein edit distance]]
* [[Algoritme Fonetik]]
** [[Metaphone]]
** [[Soundex]]
* [[Metrik kemiripan string]]
** [[Jarak Damerau–Levenshtein]]
** [[Jarak Hamming]]
** [[Jarak Jaro-Winkler]]
** [[Jarak Levenshtein]]


=== [[Algoritma penyusunan]] ===
=== [[Algoritme penyusunan]] ===


* [[Binary search tree|Binary tree sort]]
* [[Binary search tree|Binary tree sort]]
* [[Bogosort]]
* [[Bogosort]]
* [[Bubble sort]]: for each pair of indices, swap the items if out of order
* [[Bubble sort]]: untik setiap pasangan, tukar item tersebut
* [[Bucket sort]]
* [[Bucket sort]]
* [[Comb sort]]
* [[Comb sort]]
Baris 64: Baris 72:
* [[Counting sort]]
* [[Counting sort]]
* [[Gnome sort]]
* [[Gnome sort]]
* [[Heapsort]]: convert the list into a heap, keep removing the largest element from the heap and adding it to the end of the list
* [[Heapsort]]: mengubah list menjadi heap, lalu pindah yang terbesar kepada daftar.
* [[Insertion sort]]: determine where the current item belongs in the list of sorted ones, and insert it there
* [[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
* [[Merge sort]]: sort the first and second half of the list separately, then merge the sorted lists
* [[Pancake sorting]]
* [[Pancake sorting]]
* [[Pigeonhole sort]]
* [[Pigeonhole sort]]
* [[Quicksort]]: pisah daftar menjadi dua daftar, yang satu lebih rendah yang satu lebih besar, dan urut terpisah.
* [[Quicksort]]: divide list into two, with all items on the first list coming before all items on the second list.; then sort the two lists. Often the method of choice
* [[Radix sort]]: sorts strings letter by letter
* [[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
* [[Selection sort]]: pick the smallest of the remaining elements, add it to the end of the sorted list
Baris 77: Baris 85:
* [[Topological sorting|Topological sort]]
* [[Topological sorting|Topological sort]]


== [[Data compression|Compression algorithms]] ==
== [[Kompresi data]] ==


=== [[Kompresi data tanpa kehilangan]] ===
=== [[:Category:Lossless compression algorithms|Lossless compression algorithms]] ===


* [[Burrows-Wheeler transform]]: preprocessing useful for improving lossless compression
* [[Burrows-Wheeler transform]]: preprocessing useful for improving lossless compression
Baris 85: Baris 93:
* [[Delta encoding]]: aid to compression of data in which sequential data occurs frequently
* [[Delta encoding]]: aid to compression of data in which sequential data occurs frequently
* [[Incremental encoding]]: delta encoding applied to sequences of strings
* [[Incremental encoding]]: delta encoding applied to sequences of strings
* [[LZW]]: lossless data compression (Lempel-Ziv-Welch)
* [[LZW]]: singkatan dari (Lempel-Ziv-Welch)
* [[LZ77 (algorithm)]]: LZ77 and LZ78 are the names for the two lossless data compression algorithms
* [[LZ77 (algorithm)]]: LZ77 and LZ78 are the names for the two lossless data compression algorithms
* [[LZMA]]: short for Lempel-Ziv-Markov chain-Algorithm
* [[LZMA]]: singkatan dari Lempel-Ziv-Markov chain-Algorithm
* [[LZO]]: data compression algorithm that is focused on speed
* [[LZO]]: pemadatan data yang cepat
* [[PPM compression algorithm]]
* [[PPM compression algorithm]]
* [[Shannon-Fano coding]]
* [[Shannon-Fano coding]]
* [[Truncated binary encoding]]
* [[Truncated binary encoding]]
* [[Run-length encoding]]: lossless data compression taking advantage of strings of repeated characters
* [[Run-length encoding]]: pemadatan data yang menggunakan deretan huruf yang berulang.
* [[SEQUITUR algorithm]]: lossless compression by incremental grammar inference on a string
* [[SEQUITUR algorithm]]: lossless compression by incremental grammar inference on a string
* [[Embedded Zerotree Wavelet|EZW (Embedded Zerotree Wavelet)]]
* [[Embedded Zerotree Wavelet|EZW (Embedded Zerotree Wavelet)]]
Baris 107: Baris 115:
** [[Rice 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]] ===
=== [[:Category:Lossy compression algorithms|Lossy compression algorithms]] ===


* [[Linear predictive coding]]: lossy compression by representing the spectral envelope of a digital signal of speech in compressed form
* [[Linear predictive coding]]: lossy compression by representing the spectral envelope of a digital signal of speech in compressed form
Baris 131: Baris 139:
* [[Ray tracing]]: realistic image [[rendering (computer graphics)|rendering]]
* [[Ray tracing]]: realistic image [[rendering (computer graphics)|rendering]]


== Algoritma [[Kriptografi]] ==
== Algoritme [[Kriptografi]] ==
''Lihat juga [[Topik dalam kriptografi]]''
''Lihat juga [[Topik dalam kriptografi]]''


* [[Enkripsi simetris]] dengan kata kunci:
* [[symmetric key algorithm|Symmetric (secret key) encryption]]:
** [[Advanced Encryption Standard]] (AES), winner of NIST competition
** [[Advanced Encryption Standard]] (AES), pemenang kompetisi [[National Institute of Standards and Technology|NIST]] pada tahun 2000
** [[Blowfish (cipher)|Blowfish]]
** [[Blowfish (cipher)|Blowfish]]
** [[Data Encryption Standard]] (DES), sometimes DE Algorithm, winner of NBS selection competition, replaced by AES for most purposes
** [[Data Encryption Standard]] (DES), pemenang kompetisi [[National Institute of Standards and Technology|NBS]] (sekarang NIST), telah digantikan dengan AES.
** [[International Data Encryption Algorithm|IDEA]]
** [[International Data Encryption Algorithm|IDEA]]
** [[RC4 (cipher)]]
** [[RC4 (cipher)]]
* [[Enkripsi asimetris]] dengan kunci publik atau [[tanda tangan digital]]:
* [[Asymmetric key algorithm|Asymmetric (public key) encryption]] or [[digital signature]]:
** [[Digital Signature Algorithm|DSA]]
** [[Digital Signature Algorithm|DSA]]
** [[ElGamal encryption|ElGamal]]
** [[ElGamal encryption|ElGamal]]
Baris 147: Baris 155:
** [[NTRUEncrypt]]
** [[NTRUEncrypt]]
* Cryptographic [[Message digest]] functions:
* Cryptographic [[Message digest]] functions:
** [[MD5]] – Sekarang ini sudah terdapat algoritme yang mampu memalsukan jumlah MD5.<ref>[http://www.mscs.dal.ca/~selinger/md5collision/ Presentasi pemalsuan jumlah MD5]</ref>
** [[MD5]] – Note that there is now a method of generating collisions for MD5
** [[RIPEMD-160]]
** [[RIPEMD-160]]
** [[SHA-1]]
** [[SHA-1]]
** [[keyed-hash message authentication code|HMAC]]: keyed-hash message authentication
** [[keyed-hash message authentication code|HMAC]]: keyed-hash message authentication
* [[Cryptographically secure pseudo-random number generator]]s
* [[Perhitungan nomor acak tentu yang aman untuk persandian]] (Cryptographically secure pseudo-random number generator)
** [[Blum Blum Shub]] - based on the hardness of [[integer factorization|factorization]]
** [[Blum Blum Shub]] - berdasarkan [[faktorisasi prima]].
** [[Yarrow algorithm]]
** [[Yarrow algorithm]]
** [[Fortuna (PRNG)|Fortuna]], allegedly an improvement on Yarrow
** [[Fortuna (PRNG)|Fortuna]], allegedly an improvement on Yarrow
Baris 158: Baris 166:
** [[Diffie-Hellman]]: key exchange
** [[Diffie-Hellman]]: key exchange


== Algoritma [[Distributed systems]] ==
== Algoritme [[Distributed systems]] ==
* [[Lamport ordering]]: a [[partial order]]ing of events based on the ''happened-before'' relation
* [[Lamport ordering]]: a [[partial order]]ing of events based on the ''happened-before'' relation
* [[Snapshot algorithm]]: a snapshot is the process of recording the global state of a system
* [[Snapshot algorithm]]: a snapshot is the process of recording the global state of a system
* [[Vector ordering]]: a [[total order]]ing of events
* [[Vector ordering]]: a [[total order]]ing of events


== Algoritma Numerical ==
== Algoritme Numerik ==
''See also main article ''[[numerical analysis]]'' and [[list of numerical analysis topics]]''
''See also main article ''[[numerical analysis]]'' and [[list of numerical analysis topics]]''


* [[Algoritma De Boor]]: computes [[Spline (mathematics)|splines]].
* [[Algoritme De Boor]]: computes [[Spline (mathematics)|splines]].
* [[Algoritma De Casteljau]]: computes [[Bezier curve]]s
* [[Algoritme de Casteljau]]: melakukan perhitungan [[kurva Bézier]]
* [[False position method]]: approximates roots of a function
* [[False position method]]: approximates roots of a function
* [[Gauss-Jordan elimination]]: solves systems of linear equations
* [[Eliminasi Gauss-Jordan]]: menyelesaikan sistem persamaan linear
* [[Algoritma Gauss-Legendre]]: computes the digits of [[pi]]
* [[Algoritme Gauss-Legendre]]: computes the digits of [[pi]]
* [[Gauss-Newton algorithm]]: find minimum of function of several variables
* [[Gauss-Newton algorithm]]: find minimum of function of several variables
* [[Penambahan Kahan]]: menambahkan bilangan-bilangan titik mengambang dengan ketelitian lebih
* [[Kahan summation algorithm]]: a more accurate method of summing floating-point numbers
* [[Levenberg-Marquardt algorithm]]: find minimum of function of several variables
* [[Levenberg-Marquardt algorithm]]: find minimum of function of several variables
* [[MISER algorithm]]: Monte Carlo simulation, [[numerical integration]]
* [[MISER algorithm]]: Monte Carlo simulation, [[numerical integration]]
* [[Newton's method]]: finds zeros of functions with [[calculus]]
* [[Newton's method]]: finds zeros of functions with [[calculus]]
* [[Bracketing Methods]]:
* [[Bracketing Methods]]:
* [[Pembulatan]]: membulatkan bilangan pecah
* [[Rounding functions]]: the classic ways to round numbers
* [[Secant method]]: approximates roots of a function
* [[Secant method]]: approximates roots of a function
* [[Shifting nth-root algorithm]]: digit by digit root extraction
* [[Shifting nth-root algorithm]]: digit by digit root extraction
* [[Akar persegi]]: menghitungkan akar persegi dengan ketelitian terbatas
* [[Square root]]: approximates the square root of a number
* [[Strassen algorithm]]
* [[Strassen algorithm]]


Baris 196: Baris 204:
* [[CORDIC]]: Fast [[trigonometric function]] computation technique.
* [[CORDIC]]: Fast [[trigonometric function]] computation technique.
* [[Fast Fourier transform]]: determines the frequencies contained in a (segment of a) signal
* [[Fast Fourier transform]]: determines the frequencies contained in a (segment of a) signal
**[[Cooley-Tukey FFT algorithm]]
** [[Cooley-Tukey FFT algorithm]]
* [[Rainflow-counting algorithm]]: Reduces a complex [[stress (physics)|stress]] history to a count of elementary stress-reversals for use in [[fatigue (material)|fatigue]] analysis
* [[Rainflow-counting algorithm]]: Reduces a complex [[stress (physics)|stress]] history to a count of elementary stress-reversals for use in [[fatigue (material)|fatigue]] analysis
* [[Osem]]: algorithm for processing of medical images
* [[Osem]]: algorithm for processing of medical images
* [[Goertzel algorithm]] Can be used for [[DTMF]] digit decoding.
* [[Goertzel algorithm]] Can be used for [[Persinyalan nada ganda multifrekuensi|DTMF]] digit decoding.
* [[Discrete Fourier transform]]
* [[Discrete Fourier transform<ref>frequency domain ICA</ref>** [[Rader's FFT algorithm]]
** [[Rader's FFT algorithm]]
** [[Bluestein's FFT algorithm]]
** [[Bluestein's FFT algorithm]]


Baris 211: Baris 218:
** [[Index calculus algorithm]]
** [[Index calculus algorithm]]
* [[Euclidean algorithm]]: computes the [[greatest common divisor]]
* [[Euclidean algorithm]]: computes the [[greatest common divisor]]
* [[Faktorisasi prima]]: pemecahan bilangan bulat menjadi faktor [[Bilangan prima|prima]].
* [[Integer factorization]]: breaking an integer into its [[prime number|prime]] factors
** [[Trial division]]
** [[Trial division]]
** [[Lenstra elliptic curve factorization]]
** [[Faktorisasi kurva eliptik Lenstra]]
** [[Pollard's rho algorithm]]
** [[Pollard's rho algorithm]]
** [[Pollard's p-1 algorithm]]
** [[Pollard's p-1 algorithm]]
Baris 219: Baris 226:
** [[Quadratic sieve]]
** [[Quadratic sieve]]
** [[Special number field sieve]]
** [[Special number field sieve]]
** [[General number field sieve]]
** [[General number field sieve]]
** [[Jones's period proxy algorithm]]
** [[Jones's period proxy algorithm]]
* [[Algoritme perkalian]]: cara perkalian dua bilangan yang cepat.
* [[Multiplication algorithm]]s: fast multiplication of two numbers
* [[Ujian bilangan prima]]: menentukan apakah suatu bilangan adalah [[bilangan prima]].
* [[Primality test]]s: determining whether a given number is [[prime number|prime]]
** [[AKS primality test]]
** [[AKS primality test]]
** [[Miller-Rabin primality test]]
** [[Miller-Rabin primality test]]
Baris 241: Baris 248:
* [[Recursive descent parser]]: A [[top-down parser]] suitable for LL(''k'') grammars
* [[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 grammar]]s
* [[LL parser]]: A relatively simple [[linear time]] parsing algorithm for a limited class of [[context-free grammar]]s
* [[LR parser]]: A more complex [[linear time]] parsing algorithm for a larger class of [[context-free grammar]]s. Variants:
* [[LR parser]]: A more complex [[linear time]] parsing algorithm for a larger class of [[context-free grammar]]s. Variants:
** [[Operator-precedence parser]]
** [[Operator-precedence parser]]
** [[Simple LR parser|SLR (Simple LR) parser]]
** [[Simple LR parser|SLR (Simple LR) parser]]
Baris 258: Baris 265:
* [[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).
* [[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).


== [[Komputer kuantum|Algoritma kuantum]] ==
== [[Komputer kuantum|Algoritme kuantum]] ==
''<small>Application of [[quantum computation]] to various categories of problems and algorithms</small>''
''<small>Application of [[quantum computation]] to various categories of problems and algorithms</small>''


Baris 265: Baris 272:
* [[Deutsch-Jozsa algorithm]]: criterion of balance for Boolean function
* [[Deutsch-Jozsa algorithm]]: criterion of balance for Boolean function


== Algoritma medis ==
== Algoritme medis ==


* [[Medical algorithm]]
* [[Medical algorithm]]
Baris 271: Baris 278:


== Lainnya ==
== Lainnya ==
*[[Astronomical algorithm]]s
* [[Astronomical algorithm]]s
*[[Banker's algorithm]]
* [[Banker's algorithm]]
*[[Baum-Welch algorithm]]
* [[Algoritme Baum-Welch]]
*[[Doomsday algorithm]]: day of the week
* [[Doomsday algorithm]]: day of the week
*[[Levenberg-Marquardt nonlinear least squares fitting algorithm]]
* [[Levenberg-Marquardt nonlinear least squares fitting algorithm]]
*[[Marzullo's algorithm]]: distributed clock synchronization
* [[Marzullo's algorithm]]: distributed clock synchronization
*[[Page replacement algorithms]]
* [[Page replacement algorithms]]
*[[Risch algorithm]]
* [[Risch algorithm]]
*[[Schreier-Sims algorithm]]
* [[Schreier-Sims algorithm]]
*[[Todd-Coxeter algorithm]]
* [[Todd-Coxeter algorithm]]
*[[Viterbi algorithm]]
* [[Viterbi algorithm]]
* [[Penukaran XOR]]: menukar nilainya dua variabel tanpa menggunakan variabel sementara
*[[Xor swap algorithm]]: swaps the values of two variables without using a buffer
* [[Algoritme merge]]
* [[Algoritme penggantian halaman]]


== Referensi ==
{{matematika-stub}}
<references />


[[Kategori:Algoritma| ]]
[[Kategori:Algoritme| ]]
[[Kategori:Daftar bertopik matematika]]
[[Kategori:Daftar bertopik matematika|Algoritme]]

[[de:Liste von Algorithmen]]
[[en:List of algorithms]]
[[et:Algoritmide loend]]
[[pt:Lista de algoritmos]]
[[ru:Список алгоритмов]]
[[sr:Списак алгоритама]]
[[tg:Рӯихати алгоритмҳо]]

Revisi terkini sejak 24 Desember 2023 04.18

Berikut adalah daftar algoritme.

Lihat juga daftar struktur data, daftar topik umum algoritme, dan daftar istilah yang berhubungan dengan algoritme dan struktur data.

Algoritme kombinatorial[sunting | sunting sumber]

Algoritme kombinatorial umum[sunting | sunting sumber]

Algoritme graf[sunting | sunting sumber]

Artikel utama: Teori graf

Algoritme pencarian[sunting | sunting sumber]

Algoritme string[sunting | sunting sumber]

Pencarian[sunting | sunting sumber]

Pencocokan string[sunting | sunting sumber]

Algoritme penyusunan[sunting | sunting sumber]

Kompresi data[sunting | sunting sumber]

Kompresi data tanpa kehilangan[sunting | sunting sumber]

Kompresi data berkehilangan[sunting | sunting sumber]

Computational geometry[sunting | sunting sumber]

Grafik komputer[sunting | sunting sumber]

  • 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

Algoritme Kriptografi[sunting | sunting sumber]

Lihat juga Topik dalam kriptografi

Algoritme Distributed systems[sunting | sunting sumber]

Algoritme Numerik[sunting | sunting sumber]

See also main article numerical analysis and list of numerical analysis topics

Optimization algorithms[sunting | sunting sumber]

Digital signal processing[sunting | sunting sumber]

Number theoretic algorithms[sunting | sunting sumber]

Numerical algebra[sunting | sunting sumber]

Parsing[sunting | sunting sumber]

Teknik perangkat lunak[sunting | sunting sumber]

Algoritme kuantum[sunting | sunting sumber]

Application of quantum computation to various categories of problems and algorithms

Algoritme medis[sunting | sunting sumber]

Lainnya[sunting | sunting sumber]

Referensi[sunting | sunting sumber]

  1. ^ Presentasi pemalsuan jumlah MD5
  2. ^ frequency domain ICA
Diperoleh dari "https://wiki-indonesia.club/w/index.php?title=Daftar_algoritme&oldid=25057544"