Big O notation

See our other Step by Step video series below :-

In this video we will understand the concept of big O notation.

[sarvanastar]

Following you, your books for 10 years. Myself sravan sir we met in delhi. Many MVP's and big speakers where eating with spoon and the only person in the corner who was eating with hand and enjoying was you. Felt connected .. Keep it up.
You are living C# legend of India. Awesome video crisp and clear.

[ramakdixit]

Amazing, i never understood this concept so well before this video. Thanks

[praveenakhasnis]

wow.. such a wonderful explanation sir.. i never understood this concept in my engineering days. Thank you so much

[squishysam]

There are 2 issues here: 1) As people have already mentioned here, your O(2n) is incorrect and misleading. It is *completely* different from O(2^n) which is probably what you meant to say. O(2n), is a run-time analysis of an algorithm typically represented by 2 non-nested for-loops going through the same # of iterations. With Big-O notation we drop the constants, so O(2n) is simplified down to O(n). The second issue is that this video only focuses on the time complexity part of Big-O analysis and doesn't talk about the space complexity at all, which is just as important. I've enjoyed all of your videos though. Keep up the great work!

[russellinthebush]

I think it would help to fix your notation. O(2n) = O(n) and so O(2n) should never be used. I think you really meant O(2^n) or the order of 2 to the nth power.

[الشافعيمذهباالإسحاقينسباالصوما]

Very good explained. More videos about Big O notation

[tech-with-inder]

Thanks for another great explanation..!!

[mmahon]

Namaskar, This is an excellent resource for explaining O notation but I am curious how one would write a function for O(logn) in c#. Shukria