Depth-first search in APL

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

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

  • @electronicwoe
    @electronicwoe 8 лет назад +12

    The birds!

  • @ophello
    @ophello 9 лет назад +16

    Are you a wizard

  • @christopherwright6490
    @christopherwright6490 10 лет назад +1

    Say I have
    argumentA {expression_1}{expression_2}argumentB
    how do we know which of expression_1 and expression_2 are the operands of the higher order operator (which will be the other one!)?
    I guess the Arg{}{}{}Arg is unambiguous, but what about the "less complete" expressions ?
    thanks for the fun video1

  • @DFunctionista
    @DFunctionista 8 лет назад +3

    Birdsong recorded 2014-06-21T05:30 UTM:289854 4957717

  • @ahmedel-safty8275
    @ahmedel-safty8275 9 лет назад +1

    what is the name of the compiler

  • @DanielAjoyB
    @DanielAjoyB 10 лет назад +5

    What is this black magic!

  • @ZimbaZumba
    @ZimbaZumba 10 лет назад

    Lol, I just about died when I saw the title of this video. Do people still use APL and surely APL was not designed for this type of algorithm. I still enjoyed the video, cool