1 5 Merge Sort Motivation and Example 9 min

แชร์
ฝัง
  • เผยแพร่เมื่อ 26 ม.ค. 2017

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

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

    He talking about "futuristic" 2012, yet I'm here watching this in 2020

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

      I agree
      watching these for CP

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

      @@blank3525 good luck with your venture bro

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

    I haven't seen any programmer being capable of write Merge Sort on top of his head. His claims at 3:57 are pretty strong.

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

      I think he means you should be able to write the code if u know how it works?

    • @bytefu
      @bytefu 2 ปีที่แล้ว +14

      To be fair, it's hard to write on top of your own head. Much easier on someone else's.

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

      Well, even binary search which has a much simpler idea is not so easy to implement without checking how it is done

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

      Yeah, I think he means if you got a high-level understanding of how it works then you should be able to write it. I just watched this one video and then implemented it based on his explanation. Granted, it took me over an hour.

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

    Great content, but speech too fast for me

  • @tomfranky1744
    @tomfranky1744 11 หลายเดือนก่อน +2

    I first tried his Part 1 (The Basics) book but found it too complicated to figure out algorithms. Then cam here with that hope his videos are better and help me to understand the book better, but now I see he talks as fast as a human being can talk (I don't know why!).