Daftar algoritme: Perbedaan antara revisi

{{terjemah|Inggris}}

 

 

 

 

* (uniformly distributed) [[Pseudorandom number generator]]s:

** [[Blum Blum Shub]]

** [[Mersenne twister]]

 

 

* [[Nonblocking Minimal Spanning Switch]] say, for a [[telephone exchange]]

* [[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]]

* [[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).

 

 

 

 

* [[Binary search tree|Binary tree sort]]

* [[Bogosort]]

* [[Bucket sort]]

* [[Comb sort]]

* [[Counting sort]]

* [[Gnome sort]]

* [[Pancake sorting]]

* [[Pigeonhole sort]]

* [[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

* [[Ray tracing]]: realistic image [[rendering (computer graphics)|rendering]]

 

''Lihat juga [[Topik dalam kriptografi]]''

 

** [[International Data Encryption Algorithm|IDEA]]

** [[RC4 (cipher)]]

** [[Digital Signature Algorithm|DSA]]

** [[ElGamal encryption|ElGamal]]

** [[NTRUEncrypt]]

* Cryptographic [[Message digest]] functions:

** [[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)

** [[Yarrow algorithm]]

** [[Fortuna (PRNG)|Fortuna]], allegedly an improvement on Yarrow

** [[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

* [[Gauss-Newton 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]]

* [[Newton's method]]: finds zeros of functions with [[calculus]]

* [[Secant method]]: approximates roots of a function

* [[Shifting nth-root algorithm]]: digit by digit root extraction

* [[Strassen 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

** [[Bluestein's FFT algorithm]]

 

** [[Quadratic sieve]]

** [[Special number field sieve]]

** [[Jones's period proxy algorithm]]

** [[AKS primality test]]

** [[Miller-Rabin primality test]]

* [[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).

 

''<small>Application of [[quantum computation]] to various categories of problems and algorithms</small>''

 

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

 

 

* [[Medical algorithm]]

* [[Astronomical algorithm]]s

* [[Banker's algorithm]]

* [[Doomsday algorithm]]: day of the week

* [[Levenberg-Marquardt nonlinear least squares fitting algorithm]]

* [[Todd-Coxeter algorithm]]

* [[Viterbi algorithm]]

 

<references />