Novo curso! Todo programador deveria aprender IA generativa!
Experimente uma aula grƔtis+ 3
[C Language] Algorithm Analysis
Can someone tell me something about algorithm analysis in C? Worst case and etc. O() f() n, i... O(n^2) O(2^n) O(1) Of course if is that possible... Text or link is welcome...
2 Respostas
+ 9
Nitrocell complexity of any algorithms are dependent on the steps to solve that algorithm for an particular task these is generally represented by notation and 3 notation are used for showing the complexity.
1) BigOh (O)
2) Thetha (Ī¦)
3) Omega (Ļ)
all this notation are represented to any algorithm according to there time to execute.
This link may give you some information on the topic with an example.
https://www.sololearn.com/learn/6362/?ref=app
+ 1
GAWEN STEASY thanks so much! šš