+ 2
complexity
How to calculate time complexity of an algorithm need help ❤️
2 odpowiedzi
0
If you use x nested for loops with each n iterations your complexity is O(n ^ x) for example.
Your O complexity is always definded by the worst/slowest part in your code
Często masz takie pytania?
Ucz się bardziej efektywnie, za darmo:
Popularne dzisiaj
Pig Latin
0 Votes
Someone can help me
0 Votes
Square Roots
0 Votes
What's wrong with this?
2 Votes
I’m new someone can help me
0 Votes
What's doctype htMl
2 Votes
HTML community, HELP!!
0 Votes
need help with the HTML code
1 Votes