Complexity of algorithms/Related Articles: Difference between revisions
Jump to navigation
Jump to search
imported>Jitse Niesen (start) |
No edit summary |
||
| Line 14: | Line 14: | ||
{{r|Complexity class}} | {{r|Complexity class}} | ||
{{r|Turing machine}} | {{r|Turing machine}} | ||
==Articles related by keyphrases (Bot populated)== | |||
{{r|Prostate}} | |||
{{r|Central processing unit}} | |||
Latest revision as of 12:01, 31 July 2024
- See also changes related to Complexity of algorithms, or pages that link to Complexity of algorithms or to this page or whose text contains "Complexity of algorithms".
Parent topics
- Algorithm [r]: A sequence of steps used to solve a problem. [e]
- Big O notation [r]: Mathematical notation to express various upper bounds concerning asymptotic behaviour of functions, e.g. the complexity of algorithms in computer science. [e]
- Little o notation [r]: Mathematical notation to express various bounds concerning asymptotic behaviour of functions, e.g. the complexity of algorithms in computer science. [e]
- Complexity class [r]: Add brief definition or description
- Turing machine [r]: Add brief definition or description
- Prostate [r]: Compound tubuloalveolar exocrine gland of the male mammalian reproductive system. [e]
- Central processing unit [r]: The component in an electronic computer that performs all the active processing of its programming directions, and manipulation of data; this includes performing calculations on numbers, and determining which particular steps to perform. [e]