SkipCaptcha
292
edits
Changes
Jump to navigation
Jump to search
Line 33:
Line 33: + + + + + + + + + + + + + + +
Additions
===Greedy Algorithms===
===Greedy Algorithms===
Algorithms which find local optimizations instead of global optimizations are referred to as <b>greedy</b>. Although they may not return an optimal result, they tend to execute much faster than non-greedy algorithms.
Algorithms which find local optimizations instead of global optimizations are referred to as <b>greedy</b>. Although they may not return an optimal result, they tend to execute much faster than non-greedy algorithms.
===Sorting===
Sorting algorithms are used to order data.
===Searching===
Search algorithms find data matching a certain criteria, using some form of pattern matching, within a larger set of data.
===Pattern Matching===
Pattern matching algorithms are used to match different data. Regular Expressions are a way of describing a pattern and are commonly used for pattern matching algorithms.
===Evolutionary algorithm===
An [[Evolutionary algorithm]] is a type of stochastic numerical analysis.
===Numerical===
Numerical algorithms deal directly with numbers. They can be arithmetical (such as performing division), or seminumerical (such as generating random values). Note: Donald Knuth believed this was a more proper term for all numerical algorithms<ref>Donald Knuth, <i>The Art of Computer Programming: Seminumerical Algorithms</i> (Addison Wesley:1969)</ref>
==Examples of Algorithms==
==Examples of Algorithms==