1.4 Potential Method in Amortized Analysis | With Examples| Advanced Data Structures | Algorithms

Поделиться
HTML-код
  • Опубликовано: 31 июл 2024
  • In this video, I will explain the last method of amortized time complexity computation i.e. Potential Method using examples of Augmented Stack and Dynamic Tables.
    I have already explained the first two methods in my previous videos of this Advanced Data Structures Playlist.
    Timestamps:
    0:00 What is Potential Method?
    4:25 Augmented Stack using Potential Method
    8:30 Dynamic Tables using Potential Method
    Tags:
    #potentialmethod #ammortized #amortized #datastructures #advanceddatastructures #timecomplexity #dsa #stack #dynamictables #potential #algorithm #software #nit #iit #algorithms

Комментарии • 33

  • @shengxiongwu4373
    @shengxiongwu4373 Год назад +6

    indeed, you are my lifesaver, thank you so much for making this wonderful video

    • @uzairjavedakhtar3718
      @uzairjavedakhtar3718  Год назад +1

      I am glad that you think so ☺️
      Thanks a ton for your kind words🙂

  • @raulgomero9695
    @raulgomero9695 8 месяцев назад +1

    Very VERY helpful. I didnt understand my professor at all. You are a life saver :D

  • @ayushagarwal4253
    @ayushagarwal4253 Год назад +2

    Your example of Asim and Aman in the first Amortized Analysis video was very helpful.
    Could you extend that example to the Accounting and Potential Methods as well?
    Also, it would've been great if you also mentioned the delete operation in the dynamic table here and how it causes the table to contract.

  • @useless274
    @useless274 4 месяца назад

    loving this series. I'm self-taught hobbyist and never seen this stuff before. Only suggestion is if the math gets much more complex it may be better to reposition the camera and/or dedicate a little more space to it as the subscripts get a little hard to read. regardless, thanks so much for this content.

  • @ziadharoon4600
    @ziadharoon4600 Год назад +3

    Impressive, very nice work man.
    Keep it up!

    • @uzairjavedakhtar3718
      @uzairjavedakhtar3718  Год назад

      Thanks A Lot😊
      Kindly share my video if you found it helpful😊🖤

  • @manravsinghk
    @manravsinghk Год назад +2

    Thank you so much for your help brother. I subscribed and am so excited for new content. God bless u

  • @malyyigor34
    @malyyigor34 Год назад

    Who does compute Phi(D_i) on 10:55 and where I can find Phi(D_i) for another data structures?

  • @shashankchannawar731
    @shashankchannawar731 2 месяца назад +2

    Thankkk You :)

  • @unnatigoel809
    @unnatigoel809 2 года назад +4

    Found it. Thanks a lot.

    • @uzairjavedakhtar3718
      @uzairjavedakhtar3718  2 года назад

      Unnati please share these videos with your friends, if you found them useful🙂

  • @muhammadnabeedhaider4926
    @muhammadnabeedhaider4926 2 месяца назад

    sir in our slides it says that first insert has amortized cost = 2 rest 3, can you elaborate on this?

  • @muhammetbal4169
    @muhammetbal4169 Год назад +1

    thanks, Selam from Austria

  • @normabeatrizmansilla4103
    @normabeatrizmansilla4103 Год назад +2

    Gracias, fuiste muy claro.

  • @bbx5617
    @bbx5617 Год назад

    Teşekkürler! ^^

  • @gopalagrawal8378
    @gopalagrawal8378 2 года назад +1

    thanks u so much sir

  • @vaishnavsingh7307
    @vaishnavsingh7307 Год назад +1

    sir, can you start teaching the proofs of these algorithm(in general) as well?

  • @monkfromearth
    @monkfromearth 2 года назад

    Kudos, Uzair! 😃

  • @vivekp6418
    @vivekp6418 Год назад +1

    good class

  • @sushantkumar4917
    @sushantkumar4917 2 года назад +2

    God 👏👏

    • @uzairjavedakhtar3718
      @uzairjavedakhtar3718  2 года назад

      No, just a student who wants to help the maximum number of students like him.😉

  • @cheram9237
    @cheram9237 7 месяцев назад

    Please use manual focus