pashka's blog

By pashka, history, 5 weeks ago, In English

Here is the video of the second lecture of the course. Thanks to everyone who watched the live stream.

Here are the home tasks for the lecture, you can submit your solutions into this form.

Tomorrow at 13:00 MSK we will have a stream on Twitch where I will comment your solutions from the previous lecture.

See you next week!

 
 
 
 
  • Vote: I like it
  • +124
  • Vote: I do not like it

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Your lectures are pure gold! Thank you so much! :)

»
5 weeks ago, # |
  Vote: I like it -11 Vote: I do not like it

What is the schedule now? I missed this time too.

  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it -11 Vote: I do not like it

    never mind, I confused with the homework checking schedule.

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Thanks

»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

It was superfun watching your lecture,it felt like minutes.....

»
5 weeks ago, # |
Rev. 2   Vote: I like it +12 Vote: I do not like it

Consider changing the thumbnail style for your lectures in English. It's now hard to see/find them because everything looks so similar.

screenshot
  • »
    »
    5 weeks ago, # ^ |
      Vote: I like it +7 Vote: I do not like it

    I'm not that creative :( But there is a special playlist for English videos

    • »
      »
      »
      5 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Should I make a new thumbnail ? Will you be willing to consider it if it's good ?

      • »
        »
        »
        »
        5 weeks ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        You can definitely try, but I don't promise anything :).

        • »
          »
          »
          »
          »
          5 weeks ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          Okay great, I will get back to you by 25th with some new thumbnail ideas.

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Please explain how to mathematical drive the time complexity of remove and insert operation in heap. In the lecture only a rough idea is given i.e each time we iterate to the next/ previous layer of the tree and since the height of the tree is log(n) thus the time complexity will be that, this is what I understood but I am having trouble in driving the time complexity. Please help.