Hide comments 305

One for loop is better than two, and nested for loops are the devil. Binary search trees are king.

Big O notation is Used to tell how long the code runs for large amount of data. The bigger the power of N , longer is the time taken to run and it become less efficient.

wow

something

thinking about how long your code will run is very important

Great info for beginners. Gave insights on how to scale code

This is Great!

This helps you find a better algorithm for a coding problem not just your code works. Thanks

Love your teaching. Thank you!

Importance of Big O notation for scalibility

Log in so your best work can be saved as you advances through the game.

We apologize for the inconvenience. We encountered an internal error or misconfiguration and was unable to complete your request.

To continue, please reload the page. Thank you!

## Top Comments

One for loop is better than two, and nested for loops are the devil. Binary search trees are king.

Big O notation is Used to tell how long the code runs for large amount of data. The bigger the power of N , longer is the time taken to run and it become less efficient.

## Other Comments

wow

something

thinking about how long your code will run is very important

Great info for beginners. Gave insights on how to scale code

This is Great!

This helps you find a better algorithm for a coding problem not just your code works. Thanks

Love your teaching. Thank you!

Importance of Big O notation for scalibility