Introduction to the course and algorithm complexity

แชร์
ฝัง
  • เผยแพร่เมื่อ 18 ต.ค. 2024
  • This is the course introduction about algorithm complexity, including what "worst case running time" means and how it is measured.

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

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

    I think black board-chalk or in modern times whiteboard and markers are the best apparatus to make the things understandable to the students. This shows your knowledge level and depicts how much confident you are in the subject you are teaching. It creates a sense of occupancy of the students (obviously the interested ones). With the help of ppts slides this is impossible. you can try this on you only that take a white paper and a pencil and try to write down that on that blank paper...

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

    Is this course good if I am a beginner to algorithms and use C++ to code currently?

  • @clearclearskies
    @clearclearskies 12 ปีที่แล้ว

    I like your lecture style. Thank you.

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

    Selma Dahmani The links to the other lectures are on the course page that the professor mentions in the beginning of the lecture or in the playlist th-cam.com/play/PL6EF0274BD849A7D5.html

  • @76anoopsaxena
    @76anoopsaxena 5 ปีที่แล้ว

    I don't quite understand why is T subscript A(I) is varying for different inputs of same size. T is not time, it is number of primitive operations, so why would that vary? Did I miss something?

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

    Thanks for this lecture, it helped me out!

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

    started today :)

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

    Does anyone know if we can access the notes anywhere ?

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

    Why is dp(10) infinite?

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

      +ayushi grover I think it's because for any positive integer n, each of the numbers in a set of n numbers can be any integer. Thus ,because integers run to infinity, so does Dp(n). Even Dp(2) has an infinite number of sets. Dp([0,1]), Dp([1,1])............Dp([n,n]),.

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

      Simple reason being 1. (n is the max size of numbers for an test input) but how many such inputs exists !! infinite)

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

    Speed it up, someone.

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

    "I could say something later but I won't" wat?

  • @jameszheng66
    @jameszheng66 12 ปีที่แล้ว

    2011 still use board? Can't use overhead or something and a keyboard to type the stuff instead of writing on board? Tired of waiting and slow motion writing talking...

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

      2020 and they still use boards. :-D

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

    He's not so much lecturing as performing.