Jump to content

Hybrid algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 2001:4455:10a:3500:50d2:c392:ca50:a7f7 (talk) at 11:45, 19 October 2020 (Examples). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A hybrid algorithm is an algorithm that combines two or more other algorithms that solve the same problem, either choosing one (depending on the data), or switching between them over the course of the algorithm. This is generally done to combine desired features of each, so that the overall algorithm is better than the individual components.

"Hybrid algorithm" does not refer to simply combining multiple algorithms to solve a different problem – many algorithms can be considered as combinations of simpler pieces – but only to combining algorithms that solve the same problem, but differ in other characteristics, notably performance.

Examples

See also