3.5 Floyd's algorithm (DECISION 1 - Chapter 3: Algorithms on graphs)

Поделиться
HTML-код
  • Опубликовано: 23 дек 2024

Комментарии • 22

  • @sb27380
    @sb27380 3 года назад +15

    thank you for being the only teacher who decided to do a full course for the new spec further maths edexcel D1!

  • @ProletarianNuklearWarrior
    @ProletarianNuklearWarrior Год назад +7

    HINDS MATHS WE LOVE YOU

  • @mrfreerunners1
    @mrfreerunners1 2 года назад +2

    I don't really understand the order of an algorithm. I've noticed there is always an complexity problem question. do you have any videos on this topic ?

    • @HindsMaths
      @HindsMaths  2 года назад +1

      It's HINDS MATHS!!! I have a video of virtually everything maths related ruclips.net/video/mO7V50oSa3I/видео.html

    • @mrfreerunners1
      @mrfreerunners1 2 года назад +1

      @@HindsMaths damn! you are too good HINDS Maths haha. Thank you so much for just being :).

    • @HindsMaths
      @HindsMaths  2 года назад

      👍🏿👍🏿👍🏿

  • @tanyasamaradiwakara
    @tanyasamaradiwakara 2 года назад +1

    Thank you for making these videos, could explain q7 of exercise 3E (pg79) of D1 (order of floyd’s algorithm) I don’t quite understand how to approach questions that require you to find orders/comparisons equations. Thank you !

    • @HindsMaths
      @HindsMaths  2 года назад +1

      From part a you have (n-1)(n-2) comparisons being made. So Floyds' Algorithm is n². However, because the algorithm is being used on n items, it's order is (n² x n) = n³, therefore it's order is cubic

  • @ProletarianNuklearWarrior
    @ProletarianNuklearWarrior Год назад

    can I not just use the distance table for the length of the minimum route from x to y?

    • @HindsMaths
      @HindsMaths  Год назад +1

      No, you have to use the algorithm

  • @mrfreerunners1
    @mrfreerunners1 Год назад

    is this apart of the AS content or A2 ?

    • @HindsMaths
      @HindsMaths  Год назад

      A2

    • @JamieCroll2
      @JamieCroll2 Год назад +1

      @@HindsMaths At the start of the textbook it doesn't have an A2 yellow dot next to it, but once you get to page 73 it has the 'A' running down the LHS of the page which indicates it is a year 2 topic. So I am not too sure if it is an AS or A level content?

    • @HindsMaths
      @HindsMaths  Год назад

      @@JamieCroll2 The yellow dot is missing from the front of the book. Floyd's algorithm is part of the A level content, not AS

  • @mkrgaming1118
    @mkrgaming1118 2 года назад +1

    This is the worst algorithm out of Kruskal's, Prim's, Dijkstra's and Floyd's. Hopefully it doesn't come up on my D1 test on wednesday!

    • @HindsMaths
      @HindsMaths  2 года назад +3

      All the best for your test

  • @Lion-st5g3s378
    @Lion-st5g3s378 3 года назад +2

    Thank you!

  • @wonkwev
    @wonkwev Год назад

    this algorithm is so miserable

    • @HindsMaths
      @HindsMaths  Год назад

      It's one of my highest viewed videos, so people must be finding it challenging