re: Big-O Notation: Beginners Guide VIEW POST

TOP OF THREAD FULL DISCUSSION
re: Awesome Post! Really helped my general understanding of Big O. that said, I did have a question regarding the O(n2) definition. If you have a func...
 

Hi! Thanks, I really appreciate it!

Yes, absolutely. If you make your for-loops grows with the same input, you can have something like an array of 4 spots and go through him three, four or five times growing the complexity in something like O(4 3, 4, 5 ...n ).

If you're going in a recursive way, the complexity it doesn't is O(n n ) and becomes exponential.

 

awesome!
That makes a tonne of sense! Thanks for the reply 😊

code of conduct - report abuse