I've subscribed within coursea for data structure and algorithms course from UoC in San Diego and believe on not, this course is a way better than that!! thank you, Abdul, for the effort that you've put in this course
You explained in previous videos about these formulas nicely and when you present this formulas in this video its easy to understand instead of bihearting the functions. Thank you sir and I respect your hardworking.
One of the best and legendary teacher in the world . But it would have been good if you cover more subjects that you Know because your teaching method makes us fall in love with our subjects such is the strength of your teaching Level . Keep Shining 🔥🔥🔥🔥
After I got 85 marks in data structures now I come again for taking 90 marks in design analysis. You are amazing huge love and respect from Pakistan. .
Hi sir, you video is superb cool !! thanks for taking time to do it & being responsable. grate work sir. we have also seen log log n & sqrt n & n log n.
I think an algorithm is not realizable with f(n) = 1 /n, because if you put n = Integers, you will be getting fractional values which are impossible to run. eg. you can't run a statement 1/2 times or 1/3 times. I think you understand my point.
Best teacher in the world for algorithms. He is just straight outta heaven.
May Allah ease your difficulities in life as you have provided it for free. It is a life long Sadakh.
Ameen
Aameen
inshallah. he will get all the virgins, im jealous
Allah ka ballah 🫣
I've subscribed within coursea for data structure and algorithms course from UoC in San Diego and believe on not, this course is a way better than that!!
thank you, Abdul, for the effort that you've put in this course
True
100% true
Yes...now I'm doing that course
You are one of the most knowledgeable teacher and u teach better than my college...jzakAllah
no doubt in that bro.
@@lets_do_it1154 what is .jzakAllah
?? Is it similar to Allah hu akbar?
You explained in previous videos about these formulas nicely and when you present this formulas in this video its easy to understand instead of bihearting the functions. Thank you sir and I respect your hardworking.
You are the best teacher in the world. Thanks man for this content!!!
One of the best and legendary teacher in the world .
But it would have been good if you cover more subjects that you Know because your teaching method makes us fall in love with our subjects such is the strength of your teaching Level .
Keep Shining 🔥🔥🔥🔥
a gold mine in youtube, ahaaaaaa enjoying .
Thank you for the precise and clear explanation of whatever I see on this channel!
Mashallah nice video sir
Please continue your great job.And thank you for your great courses
After I got 85 marks in data structures now I come again for taking 90 marks in design analysis. You are amazing huge love and respect from Pakistan. .
big hugs my brother. love from Brazil
Hi sir,
you video is superb cool !! thanks for taking time to do it & being responsable.
grate work sir.
we have also seen log log n & sqrt n & n log n.
O(1) constant
O(log n) logarithmic
O(n) linear
O(n log n) Quasilinear
O(n^2) Quadratic
O(n^3) Cubic
O(2 ^n ) O(3 ^n) O(n ^n) Exponential)
O(n!) factorial
Never got teacher like u...thanks
We missed linearithmic O(n lg n) and factorial O( n! )
your lectures are awesome sir
Thanks a lot Sir for providing us these videos.🤗
My question is:
If we got f(n)=1/n.
Then what will be the order of it?
I think O(n) !
I think an algorithm is not realizable with f(n) = 1 /n, because if you put n = Integers, you will be getting fractional values which are impossible to run. eg. you can't run a statement 1/2 times or 1/3 times. I think you understand my point.
It is a maths function but cannot.be a time function.
we can't write an algorithms with this time
Sir, what is the name of function if it is of order O(√n)??
Square root time complexity
it's called exponential function as it is n^1/2
0:29
Even if f(x)=0
Can we say O(1)
Thank you , I appreciate your help so much
Thanks sir 😁
Zabardast
2:52 Should we also have root n here or is that a derivation of the ones listed?
I think it is classified as an exponential function because it can be rewritten as O(n^(1/2))
Thank you sir for the awesome lecture
wow, just wow
Very helpful thank you sir 😊
Sir we want more videos 🙏💗
Thank you ❤️ sir
What about square root of n ie. O(n^0.5)?
Thanku sir 🙏🙏
thank you, sir.
thank you
sir,,,this video is a bit yellow,,,,,,,,btw ur teaching criteria is awesome😍😊
Thank you sir
Thank you Sir 😊
Sir thank you very much
but what about o(n**1/2)
Anyone in 2024??
2030
Thanks :)
Square root of n comes under which class sir?
root function. greater than log n and less that n
Thanks
Please add courses on Python
facebook.com/groups/python.iubwn
join this group
Don't forget the O(n!)
can you differrnt function atleast one examples
Root n belongs to?
O(n^1/2) is which class sir?
root function. greater than log n and less that n
19-08-2021 8:51
I have algorithm question my teacher how can I send it to you ?
sir,what about order of root n
@@abdul_bari actually i am asking about the name of root n
means n is linear
n square is quadratic
root n is ?
what is it called if it is O(n) ?
linear
like like like
2017 students be like --y ek sal phle ku ni aya
Can anyone help me up for clearing my doubts ?
Log n
Σ( (2^i)log n+(log(2/5))(i.(2^i) )
i=0
What is big O of this please help me today ?
@@abdul_bari You are my best teacher
log(2/5) .( (logn(logn+1) )/2 ) . ( 2^(log+1) -1 )
Final question ....I so sory colud tell me big O of this
@@abdul_bari Thank you so much
n
Σ(i*(c^i)
i=0
What is the rule of this summation? ....l fell shy for you
@@abdul_bari the last question please ...
your voice is echoing
thanks