add appropriate title "algorithm performance" (#30585)
This commit is contained in:
committed by
Christopher McCormack
parent
ec50e64023
commit
354043752c
@ -2,6 +2,11 @@
|
|||||||
title: Algorithm Performance
|
title: Algorithm Performance
|
||||||
---
|
---
|
||||||
|
|
||||||
|
## Algorithm Performance
|
||||||
|
To understand the performance of algorithms, first we need to know the big-O notation.
|
||||||
|
|
||||||
|
### The Big-O Notation
|
||||||
|
####
|
||||||
In mathematics, big-O notation is a symbolism used to describe and compare the _limiting behavior_ of a function.
|
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).
|
A function's limiting behavior is how the function acts as it approaches a specific value (usually trends towards infinity).
|
||||||
|
Reference in New Issue
Block a user