Recurrence Equations Overview (Computer Science/Algorithms)

แชร์
ฝัง
  • เผยแพร่เมื่อ 8 ก.พ. 2017
  • This is my first video of a series of computer science recurrence videos that I will be posting. This video provides a brief introduction of what a recurrence is. Future videos will explain methods to solve recurrences (Master Method, Recursion-Tree, Induction, etc...) as well as provide examples where recurrences are actually solved.
    If you have any computer science/algorithm topic you need help with and need a better explanation of, please email me at "KeithGLearning@gmail.com"
    Keith
    -------------------------
    Follow me on social media!
    Instagram | / keithgalli
    Twitter | / keithgalli
    -------------------------
    If you are curious to learn how I make my tutorials, check out this video: • How to Make a High Qua...
    ⭐ Kite is a free AI-powered coding assistant that will help you code faster and smarter. The Kite plugin integrates with all the top editors and IDEs to give you smart completions and documentation while you’re typing. I've been using Kite for 6 months and I love it! www.kite.com/get-kite/?...
    *I use affiliate links on the products that I recommend. I may earn a purchase commission or a referral bonus from the usage of these links.

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

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

    Wow! Your style of explanation is unrivalled. Beautifully explained.

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

    This is the best explanation I have found for this thank you!

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

    Thanks man! Your casual way of explaining really helped me!

  • @anthonycampos2873
    @anthonycampos2873 6 ปีที่แล้ว +8

    This was really well explained and helped me understand what T(n) even stood for. Thanks!

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

      glad it helped! :)

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

    man thank you, I'm trying to figure these out for my midterm and this helped me figure out what any of this T(n) stuff meant.

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

    Really well explained and exemplified.

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

    awesome vid, thanks man!

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

    Great video! I didnt really understand why you used big o in the binary search example there in the end?
    I dont understand why its there, I thought we were not doing big O, since we are using T to denote the time. Also "getting the middle element" which operation is that?

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

    GREAAAT

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

    i am stupid but i dont know what im watching this.

  • @mr.cheeseweenie6947
    @mr.cheeseweenie6947 6 ปีที่แล้ว +2

    This was a really long n drawn out explanation. coulda just said a recrrurence is something that happens over n over. Like every time when I ask a gurl for a drink and she yells "hell no, get away from me you creepy hog!" explanation done. much faster.

    • @mr.cheeseweenie6947
      @mr.cheeseweenie6947 6 ปีที่แล้ว +1

      this was godo explanation. thx mr cheddar penis