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.
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.
Top Comments
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.
One for loop is better than two, and nested for loops are the devil. Binary search trees are king.
Other Comments
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.
i learned abou his video was how o use big o noaion he basic cocmponens o onoaioin
I'll learn that video about Big O notation is bigger than power of N
I Learn to understand the Big O Notation
I learn the importance of considering time complexity while coding.
Big O notation illustrates how an algorithm's performance or runtime grows relative to the size of the input data.
The video showed how different Big O notations affect performance as data scales, making algorithm efficiency much clearer.
I learned that Big O notation measures an algorithm’s efficiency based on time and space as input size grows.