Content deleted Content added
ClueBot NG (talk | contribs) m Reverting possible vandalism by 39.57.185.181 to version by Deli nk. Report False Positive? Thanks, ClueBot NG. (3339838) (Bot) |
|||
Line 50:
===Algorithmic complexity===
The academic field and the engineering practice of computer programming are both largely concerned with discovering and implementing the most efficient algorithms for a given class of problem. For this purpose, algorithms are classified into ''orders'' using so-called [[Big O notation]], which expresses resource use, such as execution time or memory consumption, in terms of the size of an input. Expert programmers are familiar with a variety of well-established algorithms and their respective complexities and use this knowledge to choose algorithms that are best suited to the
===Methodologies===
| |||