Daftar algoritme: Perbedaan antara revisi

* [[Algoritma Hungaria]]: algorithm for finding a perfect [[matching]]

 

 

* [[Pencarian linear]]: mencari sebuah item pada sebuah list tak berurut

* [[Tabel Hash]]: mencari sebuah item dalam sebuah kumpulan tak berurut dalam waktu O(1).

 

*[[Algoritma Aho-Corasick]]

*[[Algoritma Bitap]]

*[[Rabin-Karp string search algorithm]]

 

 

 

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

* [[Topological sorting|Topological sort]]

 

 

 

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

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

* [[Strassen algorithm]]

 

 

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

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