1.7 Compare Class of Functions

Compare Class of Functions

Courses on Udemy
================
Java Programming

Data Structures using C and C++

C++ Programming

[shauryasharma]

I AM NOT SKIPPING ANY ADS ON YOUR CHANNEL. That's the least I can do to appreciate your knowledge and generosity.

[nyakbakonyak]

Ur teaching is perfect.. Super to understand (during quarantine) 😆..

[hondaicg]

This is the best Legend in the algorithm at all
I am paying your tuition fee to watch your adds on videos

[apoorvaprabhat]

Likes to Dislikes ratio: Infinite
This just explains how good you are.

[kamaleshkhanna]

for those wondering how
n^k is always less than 2^n provided n > k^2 +1

[NishaOnYoutube]

Abdul Sir You are gem, I've taken your udemy course for ds. Love the way you teach sir....you are rare.

[gowtham_pb]

Why would someone dislike such a good video....he is even teaching for free :)

[vincentluong]

Wow, please keep uploading videos on how to get better at algorithms. Your channel is very helpful for preparing for technical interviews. Thank you

[shobhitverrma]

Bestest teacher we can find on digital platform.

[aishwaryadas]

Before i started my MS in CS, i was really scared of Algorithm. Fortunately my Algo professor is very good, followed by your videos, its a power-pack. Thank you so much for your contribution in my masters life. Sir, you are the gem I didn't know existed ❤

[shivaprasad]

This example is just amazing, the chart/time complexity representation has really given me an idea, how the actual functions respond when there larger values as input to a function, thanks a lot sir

[poorviprincess]

Thank u so much sir for these all algorithm videos.I go through many videos and books still confused and stucked but after watching these videos my confidence is leveled up.

[sanjeevk]

How 2^n is more than eg. n^4 for any value of n: 2^4 =16 whereas 4^4 =216, am i missing anything?
Also at 4:47 the graph plotted for logn, n^2 and n^3 is wrong, they can’t be straight lines

[SidIndian]

Sir .. Your teaching helped me lot for my data science preparation study on DSA - python programming ... .. Thank you soo much 🙂

[shivrajkhose]

Sir i have attended live classroom lectures..ur teaching is very helpful..keep uploading more videos..thank u

[classmate]

Thanks a lot Dear Sir.
but I have a doubt in ( when n=3, then n to the power 2 =9, and 2 to the power n = 8) so it is a contradiction to that which (n to the power 2 is less then 2 to the power n).
(1:24) min

[AbidHasan-ij]

Very help full content, I hope you will upload more content in future

[nayanpatel]

Thank you for awesome videos all videos are very helpful to clear base concepts.
log n < sqrt(n) is not always true.
True For n = 2, log 2 < sqrt(2) => 1 < 1.44 ( for n < 4 or n > 16)
False For n = 8, log8 > sqrt(8) => 3 > 2.8 ( for n > 4 or n < 16)

[karanrajmahato]

Abdul sir, your teaching process is really awesome 🤩🤩😁🙏❤️

[manjarijavvaji]

Unlike for the larger n values(Eg: n=100), I think for some lower n values(Eg: n=3) this theory might fail, which implies that the time complexity does not matter for smaller set of values.