Big O notation/Related Articles: Difference between revisions
Jump to navigation
Jump to search
imported>Pat Palmer (linking to complexity of algorithms article) |
No edit summary |
||
| (5 intermediate revisions by 3 users not shown) | |||
| Line 1: | Line 1: | ||
{{subpages}} | |||
==Parent topics== | |||
{{r|Mathematical analysis}} | |||
<!-- | |||
==Subtopics== | |||
List topics here that are included by this topic. | |||
--> | |||
==Other related topics== | |||
{{r|Computational complexity theory}} | |||
{{r|Complexity of algorithms}} | |||
{{r|Edmund Landau}} | |||
{{r|Little o notation}} | |||
{{r|Limit (mathematics)|Limit}} | |||
{{r|Limes superior}} | |||
==Articles related by keyphrases (Bot populated)== | |||
{{r|Little o notation}} | |||
{{r|Bounded set}} | |||
Latest revision as of 11:01, 18 July 2024
- See also changes related to Big O notation, or pages that link to Big O notation or to this page or whose text contains "Big O notation".
Parent topics
- Computational complexity theory [r]: Add brief definition or description
- Complexity of algorithms [r]: How fast the execution time (or memory usage) increases as the data set to be processed grows. [e]
- Edmund Landau [r]: Add brief definition or description
- 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]
- Limit [r]: Mathematical concept based on the idea of closeness, used mainly in studying the behaviour of functions close to values at which they are undefined. [e]
- Limes superior [r]: Add brief definition or description
- 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]
- Bounded set [r]: A set for which there is a constant C such that the norm of all elements in the set is less than C. [e]