1.10.1 Comparison of Functions #1

แชร์
ฝัง
  • เผยแพร่เมื่อ 8 ก.ย. 2024
  • Comparing Complex Functions
    Two functions can be compared by
    1.Substitution
    2. Applying Log
    Courses on Udemy
    ================
    Java Programming
    www.udemy.com/...
    Data Structures using C and C++
    www.udemy.com/...
    C++ Programming
    www.udemy.com/...

ความคิดเห็น • 132

  • @pradyumnsingh6278
    @pradyumnsingh6278 4 ปีที่แล้ว +84

    wish i had watched this series in lockdown...

  • @heilaal-mogren5828
    @heilaal-mogren5828 5 ปีที่แล้ว +47

    Literally AMAZING. Calm, comfortable, tidy and step-by-step explanation and reaching the point in a short time! this is what a perfect teacher means 👍🏼 MANY THANKS!

  • @marvel438
    @marvel438 5 ปีที่แล้ว +34

    The last two questions are of GATE and I was so frustrated as I could not solve it. I just searched how to compare functions asymptotically and sir your video came up. Such a perfect explanation. Sir thanks a lot.

  • @wirito
    @wirito 4 ปีที่แล้ว +101

    I like how you left this blooper in 1:34 Lol
    Thank you for these amazing videos. I am learning a lot :)

    • @oliverchen4079
      @oliverchen4079 3 ปีที่แล้ว +16

      bug or feature?

    • @humbleguy9891
      @humbleguy9891 2 ปีที่แล้ว +2

      @@oliverchen4079 depends on the user :)

    • @sachinbansal4622
      @sachinbansal4622 4 หลายเดือนก่อน

      this was necessary to give you in-person class experience! hahaa

  • @asishraz6173
    @asishraz6173 4 ปีที่แล้ว +21

    On behalf of the CBSE students, THANK YOU Abdul Sir. Very fortunate to get to know about this channel of yours. Thank you once again.

  • @nattaphumjampalee206
    @nattaphumjampalee206 4 ปีที่แล้ว +14

    thanks a lot sir, you did give me a lot of knowledge than the professor at my university did ! you deserved a big thumb from the bottom of my heart!!

  • @vaibhavkumar912
    @vaibhavkumar912 6 ปีที่แล้ว +44

    rupees and paise great way of explaining

    • @qvikk333
      @qvikk333 5 ปีที่แล้ว +5

      but large number of paisa can become rupee

    • @anubha.experience
      @anubha.experience 5 ปีที่แล้ว

      @@qvikk333 Yes even for n = 8 and base 2 wont hold

    • @036karan
      @036karan 4 ปีที่แล้ว +1

      @@qvikk333 but that large number would be on both sides

    • @KiyoGam1
      @KiyoGam1 2 หลายเดือนก่อน

      No? That power 10 was only on one side. ​@@036karan

  • @indianitguru
    @indianitguru 5 ปีที่แล้ว +8

    I have been going through your videos and am pretty much impressed with the way you ease up the subject. Hats off. That is truly a talent. Will keep watching your videos.

  • @umairgillani699
    @umairgillani699 3 ปีที่แล้ว +7

    It shows that sub-continent has some of the best teachers on planet. I'm from Pakistan, and I remember I had teacher with a same name "Abdul Bari" and a master of his subject (Mathematics). Learn a lot from your videos sir, please keep helping us absorb that complex knowledge making it simple enough. Huge respect from Pakistan!!

  • @sushantgupta1564
    @sushantgupta1564 4 ปีที่แล้ว +4

    I wish I had found these tutorials a few months ago. I could have done far better in my first test. Simply you are a genius. You know how to explain these things well.

  • @devildemon7511
    @devildemon7511 3 ปีที่แล้ว +7

    Sir in the previous problem u have comapred 2logn and logn and said that 2logn is greater(they have just different coefficient) but not in the last question

  • @health.upgradedbyscience.7309
    @health.upgradedbyscience.7309 2 ปีที่แล้ว +8

    Truely amazing!! All your tutorials are a tremendous help in understanding correlations that seemed so hard to decode - but with your explanation all becomes logical and cristal clear! Thank you so much!!

  • @omerakcan3991
    @omerakcan3991 2 ปีที่แล้ว +2

    The best instructor I have ever seen in my life

  • @shobhitkumarpatkar5468
    @shobhitkumarpatkar5468 3 ปีที่แล้ว +2

    Your teaching style is really very simple and easy to understand. Thanks a lot for the best lectures.

  • @manhazehra8823
    @manhazehra8823 3 ปีที่แล้ว +2

    Tomorrow is my exam. If your videos would not been on TH-cam I would definitely fail. Thank you so much Sir. Rise and shine...May allah bless you abundantly. Kindly increase your playlists 🙏

  • @aadarshbishen7078
    @aadarshbishen7078 3 ปีที่แล้ว +1

    dividing f(n) and g(n) and apply limit n -> ∞ will be more easy to estimate.

  • @sujalchoudhary5206
    @sujalchoudhary5206 4 ปีที่แล้ว +4

    6:55 rupees and paisa perfect explanation

  • @hemantbhangale9505
    @hemantbhangale9505 4 ปีที่แล้ว +2

    Excellent progression and crystal clear content. Thanks!

  • @simranvedpathak7112
    @simranvedpathak7112 3 ปีที่แล้ว +2

    Best content on youtube 🙌🏼👍🏼

  • @Egli
    @Egli 4 ปีที่แล้ว +3

    You are the most amazing tutor!

  • @sumandas201
    @sumandas201 4 ปีที่แล้ว +3

    Thank you, sir, for this amazing video series............

  • @shreyavinchankar5643
    @shreyavinchankar5643 3 ปีที่แล้ว +7

    Do we not ignore the coefficient for logarithmic terms as well?
    Ex. 3logn > 2logn but 3n = 2n, why is it so?

  • @shiroshinomiya5714
    @shiroshinomiya5714 3 ปีที่แล้ว +2

    You're a life saver sir!

  • @thegloriousgoldeneagle
    @thegloriousgoldeneagle 5 หลายเดือนก่อน +1

    Sir thanks for these amazing videos

  • @Han-ve8uh
    @Han-ve8uh 3 ปีที่แล้ว +1

    So when comparing functions, are we using asymptotic behaviour or actual values? I don't understand the logN > loglogN so you can ignore the contribution of the 10 loglogN and focus only on 2logN.
    My example is n^2+n vs 7n. According to the video's argument, no comparison n^2 wins. But if we compare actual values (like the end of video says), 7n is bigger for n = 1,2 and only loses when n > 2, so which values are we comparing?

  • @RavinderRam
    @RavinderRam 6 ปีที่แล้ว +2

    awesome Sir Make a series of programming tutorial for non-programmer I am data analyst currently using R programming

  • @wirito
    @wirito 4 ปีที่แล้ว +11

    Professor, I see why 2logn > logn but why is 10log(logn) less than log(logn)?
    Shouldn’t it be also larger just like 2logn > logn?

    • @HarshJain-vv3yg
      @HarshJain-vv3yg 4 ปีที่แล้ว

      I also have the same doubt. I can only add that perhaps logn is a increasing f. while loglogn is a decreasing f.( by sampling), not sure about the overall nature of loglogn .
      What do you think?

    • @debrajadhikary7734
      @debrajadhikary7734 4 ปีที่แล้ว

      Yeah man ....its embarrassing 2nd function is greater

    • @Onomandah
      @Onomandah 4 ปีที่แล้ว +4

      He did not say that 10log(logn) is less than log(logn). But we are comparing the bigger n of the two functions. logn is more than log(logn), so we can ignore the log(logn) and instead compare the logn with the highest n of the other function, which is 2logn.

    • @saroj_kumar
      @saroj_kumar 4 ปีที่แล้ว +2

      Forget about the first example, lets talk about the second. In the first example f(n) is greater than g(n), but in second case sir said, we are ignoring 2 and f(n) = g(n). I have a doubt on that. If anyone reading this, can explain.

    • @humengineerhaijholalekarni8408
      @humengineerhaijholalekarni8408 4 ปีที่แล้ว +10

      no one replied so I am commenting.
      log(logn) is much smaller than logn
      why?
      consider n = 16
      then log(log16) = log(log(2^4)) = log4 = log(2^2) = 2
      and logn = log16 = 4
      hence we can say logn is larger than log(logn)
      now suppose i travel a distance say 3km and 10m and you travel say 2km and 50m
      we compare the bigger unit right? so I travelled more 3km>2km we ignore the 10 and 50m because they are smaller units.
      The same applies here

  • @monicaj3878
    @monicaj3878 3 ปีที่แล้ว

    i spent hours look for an explanation of this... thank you so much !!!

  • @SRNR_PODCAST.
    @SRNR_PODCAST. 3 ปีที่แล้ว +1

    a gold mine in youtube

  • @user-ogdbalsuzf6
    @user-ogdbalsuzf6 ปีที่แล้ว

    Your videos are amazing, you actually make Algorithms fun 😄

  • @narendrasriram
    @narendrasriram 8 หลายเดือนก่อน

    Your videos are too awesome. In this video around 7m time, you are comparing two functions, how f(n) can be bigger compared to g(n) as , let say n=4, f(n)=32, but g(n) will be 4*2^10; if we are considering log base 2

  • @sergeyshestakov4936
    @sergeyshestakov4936 5 หลายเดือนก่อน

    Спасибо Мистер

  • @cubangeorge
    @cubangeorge 4 ปีที่แล้ว +3

    comparison at 1:40 wont hold when n=1 or 0

  • @learningchannel274
    @learningchannel274 3 ปีที่แล้ว +1

    I respect this man

  • @subramaniyanvg6367
    @subramaniyanvg6367 3 ปีที่แล้ว

    Nicely explained with examples. Thank you sir.

  • @supamdeepbains5172
    @supamdeepbains5172 4 ปีที่แล้ว +1

    6:45 kya bat hai kya cheez hai paisa paisa lol

  • @silviupavel6966
    @silviupavel6966 3 ปีที่แล้ว +3

    7:00 is the comparison correct? loglogn^10 isn't equal to log10logn?

    • @user-mo3mi5gr3o
      @user-mo3mi5gr3o 7 หลายเดือนก่อน +1

      What sir said is wrong. What you have written in the comment is correct

  • @Rob-J-BJJ
    @Rob-J-BJJ ปีที่แล้ว +1

    thank u sir, u r godsend!!!

  • @somyagupta2527
    @somyagupta2527 3 ปีที่แล้ว +1

    sir in the example n^2(logn) and n(logn)^10 the first function is greater for some values and after that the second function is greater .I checked it by putting values in both the functions.

    • @animerank4907
      @animerank4907 3 ปีที่แล้ว +1

      Yeah, you can check in desmos, second function becomes greater after x = 28 or something like that.

    • @swplogic4158
      @swplogic4158 7 หลายเดือนก่อน

      @@animerank4907 No worries, sir. The professor's got it right. Just remember, "n" is a natural number, so it's gotta be "n >= 1." And for any value of "n," "f(n)" is always gonna be more than "g(n)." Plot it on a graph and take a look from "n >= 1."

  • @KhaledAhmed-cs8rv
    @KhaledAhmed-cs8rv 6 หลายเดือนก่อน

    for the second example. shouldn't the left hand side equation greater than the right one starting from n= 28,1?

  • @vishalkeshri9695
    @vishalkeshri9695 6 ปีที่แล้ว +1

    Superb sir u keep continue thnx sir

  • @IWANTHOTDOG
    @IWANTHOTDOG 6 ปีที่แล้ว

    Very good videos, they are helping me a bunch!

  • @adipratapsinghaps
    @adipratapsinghaps 3 ปีที่แล้ว

    OMG I never knew how to compare functions in 4 years of industry experience.

  • @divyachaudhary1154
    @divyachaudhary1154 6 ปีที่แล้ว

    Very clear explanation... Thanks

  • @mdaffansajjad3294
    @mdaffansajjad3294 5 ปีที่แล้ว

    great comeback at 1:38 sir sir sir

  • @mohammedadel8948
    @mohammedadel8948 2 ปีที่แล้ว

    Thank you for your efforts

  • @MrLazini
    @MrLazini 2 ปีที่แล้ว

    an excellent lesson

  • @ujjwalgupta8945
    @ujjwalgupta8945 3 ปีที่แล้ว

    sir, if the value of log is greater than 1 it will be always greater than g(n) please reply
    example 2 {time: 4:43}

  • @saptarshisahoo5075
    @saptarshisahoo5075 6 ปีที่แล้ว +1

    Great..

  • @nuzhatul596
    @nuzhatul596 3 ปีที่แล้ว

    f(n) is big omega of g(n)... @2

  • @codekalavya1843
    @codekalavya1843 2 ปีที่แล้ว

    Great examples

  • @MuhammadAsif-fj5ox
    @MuhammadAsif-fj5ox 5 ปีที่แล้ว

    Great Effort Sir!

  • @reyy9220
    @reyy9220 6 หลายเดือนก่อน

    TYSM

  • @tjsm4455
    @tjsm4455 2 ปีที่แล้ว

    Date - 17/6/22
    Imp note - a raise to log c base b == b raise to log c base a.

  • @alibabarahaei2229
    @alibabarahaei2229 ปีที่แล้ว

    Perfect👌

  • @arizablozki9370
    @arizablozki9370 11 หลายเดือนก่อน

    I think that g(n) is greater than f(n) in the first example 4:42, I think Prof. Bari mistakenly says f(n) is bigger.

    • @swplogic4158
      @swplogic4158 7 หลายเดือนก่อน

      No worries, sir. The professor's got it right. Just remember, "n" is a natural number, so it's gotta be "n >= 1." And for any value of "n," "f(n)" is always gonna be more than "g(n)." Plot it on a graph and take a look from "n >= 1."

  • @viveksaxena7376
    @viveksaxena7376 4 ปีที่แล้ว

    0:00 first method
    1:39 sec method

  • @himadrimukadam6459
    @himadrimukadam6459 ปีที่แล้ว

    Sir, I have a question. If your last question (the one with the root) has both functions asymptotically same, then why not the second one? Both functions have log n + log log n... Just different coefficients. So can they be said asymptotically same??

  • @saikumarchennu1791
    @saikumarchennu1791 5 ปีที่แล้ว

    Nice explanation sir

  • @debolinasihi9967
    @debolinasihi9967 4 ปีที่แล้ว

    Thankyou so much sir,

  • @loading757
    @loading757 5 ปีที่แล้ว

    Very helpful

  • @AnujKumar-tt5md
    @AnujKumar-tt5md 4 ปีที่แล้ว

    Thanks🌹

  • @RavinderRam
    @RavinderRam 6 ปีที่แล้ว

    make a tutorial of computer fundamental and basic programming concept e.g data structure & algorithm

  • @sajalrastogi3904
    @sajalrastogi3904 3 ปีที่แล้ว

    @7:00 sir how would we know that log(logn) should be ignored because it has lower value on both sides. if we dont know its value.

  • @91-ritikjain36
    @91-ritikjain36 3 ปีที่แล้ว

    thank you so much sir today is my exam

  • @vaibhavdiwan517
    @vaibhavdiwan517 4 ปีที่แล้ว

    Sir if you take n=100 then g(n) will become greater

  • @manhazehra8823
    @manhazehra8823 3 ปีที่แล้ว

    Plesse include all subjects of CS🙏

  • @rnjnmhta.catomato
    @rnjnmhta.catomato 2 ปีที่แล้ว

    2:58 log formulae

  • @hometvfirestick
    @hometvfirestick 3 ปีที่แล้ว

    thanks

  • @jihanIT
    @jihanIT 6 ปีที่แล้ว

    Thank you

  • @humbleguy9891
    @humbleguy9891 2 ปีที่แล้ว

    I watched it in 2017 and also in 2022.

  • @okbagaming7564
    @okbagaming7564 10 หลายเดือนก่อน +2

    الهندي تاعنا

  • @Arvy565
    @Arvy565 5 ปีที่แล้ว +1

    why is the base by default 2? shouldn't it be 10?

    • @Arvy565
      @Arvy565 5 ปีที่แล้ว

      @@abdul_bari oh I see. thanks for answering

  • @smitfultariya5984
    @smitfultariya5984 10 วันที่ผ่านมา

    7:04 answer is maybe wrong

  • @bhanupratapmudgal4831
    @bhanupratapmudgal4831 5 ปีที่แล้ว

    Fed up of this Coding Blocks Advertisement,LOL

  • @stevenbooke8594
    @stevenbooke8594 4 ปีที่แล้ว +1

    At 7:05 where you say f(n) > g(n) I don’t believe this is the case. If you graph both of those functions we can see g(n) approaches infinity faster than f(n) so isn’t f(n) < g(n)?

    • @kera2403
      @kera2403 3 ปีที่แล้ว

      You probably have taken log with a base 10 while graphing. Here the base is 2.

    • @nicksidiropoulos802
      @nicksidiropoulos802 2 ปีที่แล้ว +1

      @@kera2403 It's still true for base 2.

    • @crickfever100
      @crickfever100 ปีที่แล้ว

      i was making the same mistake,zoom out the graph and you will see f(n) >g(n)

  • @donfeto7636
    @donfeto7636 ปีที่แล้ว

    4- law is -> a^log(c) is c^log (a) not as you wrote it also first example is not correct. from section 3.2 in introudction to algorithms book

  • @cybershrajal
    @cybershrajal 2 หลายเดือนก่อน

    sir dark mode use kijiye na

  • @shabeerahamed2129
    @shabeerahamed2129 2 ปีที่แล้ว

    1:34 😄

  • @prateekkumar6426
    @prateekkumar6426 3 ปีที่แล้ว

    Sir aap ne c++ ka course q nhi banaya
    Bana dejiye premium hoga to chalega

  • @the_humble_lazy
    @the_humble_lazy 4 ปีที่แล้ว

    At 6:37....why 2logn is greater than logn....they are assymptotically same naa!

    • @the_humble_lazy
      @the_humble_lazy 4 ปีที่แล้ว

      @@abdul_bari thanks a lot sir!

    • @mohamednaufal719
      @mohamednaufal719 2 ปีที่แล้ว

      because 2logn signifies n^2 and logn signifies n.

  • @036karan
    @036karan 4 ปีที่แล้ว

    can 'n' be ever negative?

  • @jessesinger4790
    @jessesinger4790 4 ปีที่แล้ว

    How do I derive rule 4?

  • @ShivamShrivastava35
    @ShivamShrivastava35 5 ปีที่แล้ว

    where it helps in DAA

  • @ciaravlogs6202
    @ciaravlogs6202 4 ปีที่แล้ว

    Do a iready lesson

  • @arizablozki9370
    @arizablozki9370 11 หลายเดือนก่อน

    actually I am wrong for n > 10000000000000000 f(n) is bigger!

  • @chamangupta4624
    @chamangupta4624 3 ปีที่แล้ว

    Sir, Comparison question at 7:05 is not correct, you can check yourself using calculator, beyond 2.7 for any value the g(n) will be larger than f(n) , rupees and paisa explanation fails at least here , just a suggestion

    • @chamangupta4624
      @chamangupta4624 3 ปีที่แล้ว +1

      Okkk sorry sir i got it, u were not talking about the value but the order was being compared.. Right na?

  • @selinbaris7822
    @selinbaris7822 5 ปีที่แล้ว

    What is the base of the logarithm that you are taking Sir ?

    • @subhrapaladhi5888
      @subhrapaladhi5888 5 ปีที่แล้ว

      it doesn't really matter on which base you take the log. it should just be any valid base.

    • @subhrapaladhi5888
      @subhrapaladhi5888 5 ปีที่แล้ว

      it doesn't really matter on which base you take the log. it should just be any valid base.

    • @selinbaris7822
      @selinbaris7822 5 ปีที่แล้ว

      @@subhrapaladhi5888 but why

    • @subhrapaladhi5888
      @subhrapaladhi5888 5 ปีที่แล้ว

      as we are only going to compare. just make sure you take both of them on the same base

  • @cybershrajal
    @cybershrajal 2 หลายเดือนก่อน

    black bord , black t shirt

  • @GamingWithRaghu650
    @GamingWithRaghu650 ปีที่แล้ว

    haters guna hate.

  • @manavnagrani8338
    @manavnagrani8338 11 หลายเดือนก่อน

    Your way of explaining is very much similar to Khaleel sir ❤

    • @dakshpatel1769
      @dakshpatel1769 11 หลายเดือนก่อน

      He was student of khaleel sir😊

    • @swplogic4158
      @swplogic4158 7 หลายเดือนก่อน

      Who is Khaleel?

  • @ragedragon33
    @ragedragon33 4 ปีที่แล้ว

    math sucks

  • @qauattan2416
    @qauattan2416 6 หลายเดือนก่อน

    Which book you follow sir?
    Please tell me the book name you follow?
    @abdul bari