greatbody
/
freeCodeCamp
mirror of https://github.com/freeCodeCamp/freeCodeCamp.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

Added blank space between the lines (#25136)

pull/22911/head^2
Neshar89 2018-11-28 17:43:28 +01:00 committed by Aditya
parent abcf76fd7d
commit c8b0caf837
1 changed files with 2 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
guide/english/algorithms/algorithm-performance/index.md
View File

@ -3,7 +3,9 @@ title: Algorithm Performance
---
In mathematics, big-O notation is a symbolism used to describe and compare the _limiting behavior_ of a function.
A function's limiting behavior is how the function acts as it approaches a specific value (usually trends towards infinity).
In short, big-O notation is used to describe the growth or decline of a function, usually with respect to another function.
In algorithm design, we usually use big-O notation because we can see how good or bad an algorithm's performance will be. From a denotative perspective, big-O denotes the runtime in the worst possible case scenario. However, in many instances, people use it as a synonym for average expected runtime.