List of algorithms: Difference between revisions

Revision as of 19:20, 7 January 2002

Revision as of 01:03, 8 January 2002

Line 7:

* [[Binary search]]: locates an item in a sorted listvector

* [[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 (segment of a) signal

* [[Flood fill]]: Fills a connected region of a multi-dimensional array with a specified symbol

Line 24 ⟶ 22:

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

* [[Shors algorithm|Shor's algorithm]]: finds factors of a number on a quantum computer

* [[Sort algorithm|Sort algorithms]]

* [[Square root]]: approximates the square root of a number