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

* [[Topological sorting|Topological sort]]

 

 

 

* [[Burrows-Wheeler transform]]: preprocessing useful for improving lossless compression

* [[Delta encoding]]: aid to compression of data in which sequential data occurs frequently

* [[Incremental encoding]]: delta encoding applied to sequences of strings

* [[LZ77 (algorithm)]]: LZ77 and LZ78 are the names for the two lossless data compression algorithms

* [[PPM compression algorithm]]

* [[Shannon-Fano coding]]

* [[Truncated binary encoding]]

* [[SEQUITUR algorithm]]: lossless compression by incremental grammar inference on a string

* [[Embedded Zerotree Wavelet|EZW (Embedded Zerotree Wavelet)]]

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

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

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

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

 

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

 

** [[Blowfish (cipher)|Blowfish]]

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

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

 

 

* [[Simplex algorithm]]: An algorithm for solving the [[linear programming]] problem

* [[CORDIC]]: Fast [[trigonometric function]] computation technique.

* [[Fast Fourier transform]]: determines the frequencies contained in a (segment of a) signal

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

 

** [[Index calculus algorithm]]

* [[Euclidean algorithm]]: computes the [[greatest common divisor]]

** [[Trial division]]

** [[Pollard's rho algorithm]]

** [[Pollard's p-1 algorithm]]

** [[Quadratic sieve]]

** [[Special number field sieve]]

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

** [[AKS primality test]]

** [[Miller-Rabin primality test]]

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

** [[Operator-precedence parser]]

** [[Simple LR parser|SLR (Simple LR) parser]]

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

 

== Lainnya ==