Big O notation - Data Structures & Algorithms Tutorial #2 | Measuring time complexity

what does a stand for in the equation a*n + b

Thank you Sir

SO helpful! Thank you so much.

the best explanation i've seen by far

What is actually means of order of n and log n sir please explain 🙏🙏

in the dupicate sum because of break statement i think it will be O(n)..can someone clarify

Helloooo

Can you please let me know where can i practice the questions related to DSA in python

I love education

Please, could you add captions for deaf people 😊 it's a simple button 😉

Sir you didn't explain the algorithm

the best chanel I have ever encountered , you are the best . 💜💜💜

Thank you!

very well explained

best explanation 🗽

if 20 elements are their, then how iterations are possible ? .
i think 5 ,is it right

very good ! thank you!

bad explanation for last example

Thank you so much sir for teaching, 😊
Done 👍👍

Thank you so much for your explanation. I was struggling a lot for this big O notation in my uni class. your explanation is really clear and give me a fully understanding.

took a little bit of time to understand but I succeeded (thanks)

You are the best sir

Amazing

Super tutorial ! Will be cool if we can have the slides :)

Thank you!

Which book can you recommend I read for data structures, algorithms?

im trying learn python to become developing side after complete basic what in need to learn sir any suggession

Hindi me boliye sir samajhna kaam hai

It's truly wonderful explanation 🙏 thank you so much 👍

This was a good tutorial

Thank you, I think I might have understood it now. You might have saved my school task.

In 20 years of programming, I have never needed this in practice.
Just recognizing nested loops is often enough. In practice you always need to find if it is acceptable, because often it is not an issue! and if it is, then simply iterate. When interview questions are about this, then I know it is not a experienced developer. We can see that in this in this video as well:
using range(len(numbers)), and iterate by index is not something a python developer should do. ever.

why the fuck do so many people call their fucking function foo its such a dumb name

Thank you, you're a good teacher!

Thanks for the explanation it's really simple and straightforward! However, I don't think the given example for the binary search is a worst case scenario example as we didn't cut the array into halves until we didn't find the desired element and reached the last element of the array.

Maths now I can understand things 💪.

very well explained

Thanks a whole lot, but please add “space complexity” in your title for others to know you gave a touch on that

You should allow subtitles for the video. Big help sometimes

Sir, your python training classes which is launched last month is more than amazing, thanks for your great efforts. Just asking, can I get a tutorial series on data structures for C language.

sir if n=7 then log7base2 becomes 2.8 that means we requires 3 iterations?

Unable to understand "1=n/2^k"

def get_squared_numbers(numbers):
squared_numbers = []
for n in numbers:
squared_numbers.append(n * n)
return squared_numbers

numbers = [2, 3, 4, 5]
print(get_squared_numbers(numbers))

What's wrong with the get squared number functions?
It's not returning square numbers in list.

Can you explain what is logn and order of n?

Nice vedio

hi what is a in this equation {time = a*n + b}