Content deleted Content added
No edit summary |
SUBSET-SUM algorithm |
||
Line 1:
The following is an alphabetical listing of the [[algorithm|algorithms]] described in Wikipedia.
If you intend to describe a new algorithm, please read [[algorithms on Wikipedia]] first, then add a link to your article and a one-line description here.
* [[Binary search]]: locates an item in a sorted list
* [[Binary search tree]]
* [[Bubble sort]]: sorts by repeatedly comparing and exchanging adjacent items
* [[Greatest common divisor|Euclidean algorithm]]: computes the greatest common divisor of two numbers
* [[Exponentiating by squaring]]: quickly computes of powers of numbers and matrices
* [[Fast Fourier Transform]]: determines the frequencies contained in a signal
* [[Flood fill]]: Fills a connected region of a multi-dimensional array with a specified symbol
* [[Hash table algorithms]]
* [[Heapsort]]
* [[Insertion sort]]
* [[Linear search]]: finds an item in an unsorted list
* [[Merge sort]]: sorts by sorting the first half, then the second half, then merging
* [[PCX]] (decompresion algorithm)
* [[Perfect hashing]]
* [[Pigeonhole sort]]
* [[Quicksort]]: sorts by dividing the elements into small and large ones, then sorting each group
* [[Square root]]: approximates the square root of a number
* [[Complexity_classes_P_and_NP|SUBSET-SUM]]: Solves an NP-complete problem in polynomial time iff P=NP
| |||