11 cards generated

デッキが消える前に保存しよう

このフラッシュカードはまだ保存されてないよ — 離れると消えちゃう。無料アカウントを作ると保存できて、下の機能も全部使えるようになるよ。

保存して学習する
  • Save this deck to your account
  • Study with spaced repetition
  • Export to Anki (.apkg) or PDF
より大きく、より良い生成
  • Process documents up to 100 pages
  • Images extracted from your PDFs
  • Sharper text extraction & a more advanced AI model
Sign up free → Free forever · No credit card
youtube.com/watch?v=4V30R3I1vLI
  • 情報
    すべての機能を使うには「保存して編集」をクリック
    学習する
    エクスポート
    編集
    管理
公開

Flashcards in this deck (11)

検索中...

  • What are the main topics covered in this video?

    • Tracing a recursive function.  
    • Writing a recurrence relation.  
    • Solving a recurrence relation.
    recursion recurrence_relation algorithms

  • What is the basic structure of the C language function 'Test(n)'?

    If n > 0, print n and call Test(n-1).

    c_language recursion programming

  • In the example, what is the output when 'Test(3)' is called?

    3, 2, 1

    recursion tracing example

  • How many times does 'Test(n)' call itself when given 'n'?

    n+1 times

    recursion calls

  • How many times is the 'printf' function executed in 'Test(n)'?

    n times

    printf execution

  • If the time taken for 'printf' is one unit, what is the approximate time complexity of 'Test(n)'?

    n units of time

    time_complexity approximation

  • What is the time complexity of the function 'Test(n)' in Big O notation?

    O(n)

    time_complexity big_o_notation

  • What is another name for a tracing tree?

    Recursive tree

    tracing recursion tree

  • What is the next step after finding the time complexity using a tracing tree?

    Prepare a recurrence relation for the function.

    recurrence_relation algorithms

  • What is the typical function name used for recurrence relations?

    t

    recurrence_relation notation

  • What does 'n' stand for?

    Represents a variable or an unspecified number.

    math algebra