Big O notation

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.

    Posted 5 years ago
    • One for loop is better than two, and nested for loops are the devil. Binary search trees are king.

      Posted 5 years ago

      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.

        Posted 22 days ago
        • i learned abou his video was how o use big o noaion he basic cocmponens o onoaioin

          Posted 22 days ago
          • I'll learn that video about Big O notation is bigger than power of N

            Posted 22 days ago
            • I Learn to understand the Big O Notation

              Posted 22 days ago
              • I learn the importance of considering time complexity while coding.

                Posted 2 months ago
                • Big O notation illustrates how an algorithm's performance or runtime grows relative to the size of the input data.

                  Posted 7 months ago
                  • The video showed how different Big O notations affect performance as data scales, making algorithm efficiency much clearer.

                    Posted 7 months ago
                    • I learned that Big O notation measures an algorithm’s efficiency based on time and space as input size grows.

                      Posted 7 months ago
                      Delete comment?