9.1 - Prolog Recursion

Поділитися
Вставка
  • Опубліковано 30 січ 2025

КОМЕНТАРІ • 7

  • @simoncote4064
    @simoncote4064 Рік тому +1

    Thank you for the video ! Moving from OOP to functional/logical programming was a big challenge for me. This video cleared up a lot about how to think in a recursive manner.

  • @alengalindo1753
    @alengalindo1753 3 роки тому

    I totally forgot about == operator, I was unifying everything in my programs, ty so much.

  • @moazelsawaf2000
    @moazelsawaf2000 3 роки тому +2

    Great Explanation ❤
    Thank you so much sir ❤

  • @mattwyd2161
    @mattwyd2161 Рік тому +1

    you went off with thiss one

  • @quanganhle1722
    @quanganhle1722 3 роки тому

    Great video. Thanks alot

  • @rongliao4494
    @rongliao4494 2 роки тому

    why is fib(7,X) 13 instead of 11?

    • @CalangoBit
      @CalangoBit Рік тому +1

      The Fibonacci sequence is [0, 1, 1, 2, 3, 5, 8, 13, 21, 34...]. So, the seventh number in this sequence is 8 and the next one is 13 (because 5+8=13)