Daftar algoritme: Perbedaan antara revisi
Konten dihapus Konten ditambahkan
Wagino Bot (bicara | kontrib) k →Referensi: Bot: Merapikan artikel, removed stub tag |
|||
(36 revisi perantara oleh 21 pengguna tidak ditampilkan) | |||
Baris 1:
{{terjemah|Inggris}}
Berikut adalah '''daftar [[
''Lihat juga [[daftar struktur data]], [[daftar topik umum
==
===
* [[
* (uniformly distributed) [[Pseudorandom number generator]]s:
** [[Blum Blum Shub]]
** [[Mersenne twister]]
* [[Robinson-Schensted algorithm]]:
===
{{utama|Teori
* [[
* [[
* [[
* [[
* [[
* [[
* [[
* [[
* [[Nonblocking Minimal Spanning Switch]] say, for a [[telephone exchange]]
* [[Spring based algorithm]]:
* [[Topological sorting|Topological sort]]
* [[
=== [[
* [[Pencarian linear]]: mencari sebuah item pada sebuah list tak berurut
* [[
* [[Pencarian biner]]: menemukan sebuah item pada sebuah list terurut
* [[Pohon Pencarian Biner]]
Baris 39:
* [[Pencarian Depth-first]]: menelusuri sebuah graf cabang demi cabang
* [[Pencarian Best-first]]: menelusuri sebuah graf dengan urutan sesuai kepentingan dengan menggunakan [[antrian prioritas]]
* [[
* [[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).
===
==== [[
* [[
* [[
* [[
* [[
* [[
====
* [[Algoritme Bitap]]
* [[Algoritme Fonetik]]
** [[Metaphone]]
** [[Soundex]]
* [[Metrik kemiripan string]]
** [[Jarak Damerau–Levenshtein]]
** [[Jarak Hamming]]
** [[Jarak Jaro-Winkler]]
** [[Jarak Levenshtein]]
=== [[
* [[Binary search tree|Binary tree sort]]
* [[Bogosort]]
* [[Bubble sort]]:
* [[Bucket sort]]
* [[Comb sort]]
Baris 65 ⟶ 72:
* [[Counting sort]]
* [[Gnome sort]]
* [[Heapsort]]:
* [[Insertion sort]]:
* [[Merge sort]]: pisah daftar menjadi pasangan dua-dua, urutkan lalu digabung dengan satu pasangan lainnya, kembali diurutkan, dan diulang hingga menjadi daftar utuh
* [[Pancake sorting]]
* [[Pigeonhole sort]]
* [[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
Baris 78 ⟶ 85:
* [[Topological sorting|Topological sort]]
== [[
=== [[Kompresi data tanpa kehilangan]] ===
* [[Burrows-Wheeler transform]]: preprocessing useful for improving lossless compression
Baris 86 ⟶ 93:
* [[Delta encoding]]: aid to compression of data in which sequential data occurs frequently
* [[Incremental encoding]]: delta encoding applied to sequences of strings
* [[LZW]]:
* [[LZ77 (algorithm)]]: LZ77 and LZ78 are the names for the two lossless data compression algorithms
* [[LZMA]]:
* [[LZO]]: pemadatan data
* [[PPM compression algorithm]]
* [[Shannon-Fano coding]]
* [[Truncated binary encoding]]
* [[Run-length encoding]]:
* [[SEQUITUR algorithm]]: lossless compression by incremental grammar inference on a string
* [[Embedded Zerotree Wavelet|EZW (Embedded Zerotree Wavelet)]]
Baris 108 ⟶ 115:
** [[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
Baris 132 ⟶ 139:
* [[Ray tracing]]: realistic image [[rendering (computer graphics)|rendering]]
==
''Lihat juga [[Topik dalam kriptografi]]''
* [[Enkripsi simetris]] dengan kata kunci:
** [[Advanced Encryption Standard]] (AES),
** [[Blowfish (cipher)|Blowfish]]
** [[Data Encryption Standard]] (DES),
** [[International Data Encryption Algorithm|IDEA]]
** [[RC4 (cipher)]]
* [[Enkripsi asimetris]] dengan kunci publik atau [[tanda tangan digital]]:
** [[Digital Signature Algorithm|DSA]]
** [[ElGamal encryption|ElGamal]]
Baris 148 ⟶ 155:
** [[NTRUEncrypt]]
* 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>
** [[RIPEMD-160]]
** [[SHA-1]]
** [[keyed-hash message authentication code|HMAC]]: keyed-hash message authentication
* [[Perhitungan nomor acak tentu yang aman untuk persandian]] (Cryptographically secure pseudo-random number generator
** [[Blum Blum Shub]] -
** [[Yarrow algorithm]]
** [[Fortuna (PRNG)|Fortuna]], allegedly an improvement on Yarrow
Baris 159 ⟶ 166:
** [[Diffie-Hellman]]: key exchange
==
* [[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
* [[Vector ordering]]: a [[total order]]ing of events
==
''See also main article ''[[numerical analysis]]'' and [[list of numerical analysis topics]]''
* [[
* [[
* [[False position method]]: approximates roots of a function
* [[Eliminasi Gauss-Jordan
* [[
* [[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]]
* [[Bracketing Methods]]:
* [[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
* [[Strassen algorithm]]
Baris 197 ⟶ 204:
* [[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 (physics)|stress]] history to a count of elementary stress-reversals for use in [[fatigue (material)|fatigue]] analysis
* [[Osem]]: algorithm for processing of medical images
* [[Goertzel algorithm]] Can be used for [[Persinyalan nada ganda multifrekuensi|DTMF]] digit decoding.
* [[Discrete Fourier transform<ref>frequency domain ICA</ref>** [[Rader's FFT algorithm]]
** [[Bluestein's FFT algorithm]]
Baris 212 ⟶ 218:
** [[Index calculus algorithm]]
* [[Euclidean algorithm]]: computes the [[greatest common divisor]]
* [[Faktorisasi prima]]: pemecahan bilangan bulat menjadi faktor [[Bilangan prima|prima]].
** [[Trial division]]
** [[
** [[Pollard's rho algorithm]]
** [[Pollard's p-1 algorithm]]
Baris 220 ⟶ 226:
** [[Quadratic sieve]]
** [[Special number field sieve]]
** [[General number field sieve]]
** [[Jones's period proxy algorithm]]
* [[Algoritme perkalian]]: cara perkalian dua bilangan yang cepat.
* [[Ujian bilangan prima]]: menentukan apakah suatu bilangan adalah [[bilangan prima]].
** [[AKS primality test]]
** [[Miller-Rabin primality test]]
Baris 242 ⟶ 248:
* [[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
* [[LR parser]]: A more complex [[linear time]] parsing algorithm for a larger class of [[context-free grammar]]s.
** [[Operator-precedence parser]]
** [[Simple LR parser|SLR (Simple LR) parser]]
Baris 259 ⟶ 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).
== [[Komputer kuantum|
''<small>Application of [[quantum computation]] to various categories of problems and algorithms</small>''
Baris 266 ⟶ 272:
* [[Deutsch-Jozsa algorithm]]: criterion of balance for Boolean function
==
* [[Medical algorithm]]
Baris 272 ⟶ 278:
== Lainnya ==
* [[Astronomical algorithm]]s
* [[Banker's algorithm]]
* [[Algoritme Baum-Welch
* [[Doomsday algorithm]]: day of the week
* [[Levenberg-Marquardt nonlinear least squares fitting algorithm]]
* [[Marzullo's algorithm]]: distributed clock synchronization
* [[Page replacement algorithms]]
* [[Risch algorithm]]
* [[Schreier-Sims algorithm]]
* [[Todd-Coxeter algorithm]]
* [[Viterbi algorithm]]
* [[Penukaran XOR]]: menukar nilainya dua variabel tanpa menggunakan variabel sementara
* [[Algoritme merge]]
* [[Algoritme penggantian halaman]]
== Referensi ==
<references />
[[Kategori:
[[Kategori:Daftar bertopik matematika|Algoritme]]
|