Time Complexity Algorithm Analysis

แชร์
ฝัง
  • เผยแพร่เมื่อ 23 ธ.ค. 2024

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

  • @jackl5821
    @jackl5821 5 หลายเดือนก่อน +8

    This is the video. I was looking for and thanks for hitting all the details and explaining it so well in such a short time. My teacher talks so slow, low, and does not explain it well like you did. Thanks!

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

    Excellent explanation, I have an algorithms class midterm today and this helped a lot!!

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

    Dont usually bother leaving comments, but i havent done formal maths since i was 16 (8 years ago), and im currently studying for an msc in computer science. This video was absolutely invaluable, and you have an exceptional ability to explain things - thank you very much!

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

    That's perfect! Thank you for your efforts and your nice calming voice

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

    This video didn’t make sense. At 3:08 doesn’t n= n-1 not i-1? And doesn’t m=3 not 0?

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

    thanks a lot man. Keep it going. you way in explaining things is simple and straightforward

  • @aroojtayyaba.r
    @aroojtayyaba.r ปีที่แล้ว

    wow wow wow i was stuck at this since last 2 lecs but now got ittt , THANK YOUUU !!

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

    1:57 I'm not sure why when you wrote i - 1 on top of the summation, you said it never reaches i. I didn't understand what you meant by it never reaches "i"? Is it because "i" is not included due to the condition having the "

  • @Koots-g9i
    @Koots-g9i 10 หลายเดือนก่อน

    how do you know which summation formula to use?

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

      for the inner loop count++ runs in constant time so we use that as c. Then you just follow the formula. and plug in the values. If you see it says c = c(n + 1 - m) so u just plug the values

  • @玩五毛專家
    @玩五毛專家 4 ปีที่แล้ว +4

    It's easier than my teacher's teaching

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

      Sometimes you just need either more information or a different perspective.

    • @LSTG-b6f
      @LSTG-b6f 2 หลายเดือนก่อน

      Same here, ty very much !!!!!

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

    Hi randerson,
    Your videos are great and easy to understand. Can you please help me with the time complexity of maximum subsequence sum problem? Thanks in anticipation

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

    This is a good one thanks a lot

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

    thank u so much. finally i found the solution for my problem

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

    Great explanation, good work

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

    how to convert (n^2-n-6)/2 to n^2, i don't understand :D

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

      a bit late but the reason is that -n-6 are insignificant in the scale of things. they don't do much to effect the overall complexity of the algorithm,

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

      if u rm how polynomials work u usually take the biggest notation in which is n^2. the n/2 - 3 is thrown away since we don't want to complicate the complexity.

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

    Really good explanation thanks

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

    very helpful video, thanks

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

    WOW, that was rrrrrreally helpful. It opened up for me a whole class of problems. Thanks

  • @crowley5583
    @crowley5583 2 หลายเดือนก่อน +1

    Gold !

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

    Cool!! Thank you, very helpful

  • @asrithnedurumalli5263
    @asrithnedurumalli5263 9 หลายเดือนก่อน +1

    I luv you

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

    ❤❤❤❤❤❤❤

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

    Hi randerson,
    Your videos are great and easy to understand. Can you please help me with the time complexity of maximum subsequence sum problem? Thanks in anticipation