Complexity of algorithms/Related Articles: Difference between revisions
Jump to navigation
Jump to search
imported>Pat Palmer (linking to Big O notation article) |
imported>Jitse Niesen (start) |
||
| (One intermediate revision by one other user not shown) | |||
| Line 1: | Line 1: | ||
{{subpages}} | |||
==Parent topics== | |||
{{r|Computational complexity theory}} | |||
<!-- | |||
==Subtopics== | |||
List topics here that are included by this topic. | |||
--> | |||
==Other related topics== | |||
{{r|Algorithm}} | |||
{{r|Big O notation}} | |||
{{r|Little o notation}} | |||
{{r|Complexity class}} | |||
{{r|Turing machine}} | |||
Latest revision as of 11:28, 7 August 2008
- 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