Эти карточки ещё не сохранены — они исчезнут, как только ты уйдёшь. Заведи бесплатный аккаунт, чтобы сохранить их и получить доступ ко всем функциям ниже.
What are the main topics covered in this video?
Просматривай карточки здесь или sign up to study with spaced repetition.
What is the basic structure of the C language function 'Test(n)'?
If n > 0, print n and call Test(n-1).
Просматривай карточки здесь или sign up to study with spaced repetition.
In the example, what is the output when 'Test(3)' is called?
3, 2, 1
Просматривай карточки здесь или sign up to study with spaced repetition.
How many times does 'Test(n)' call itself when given 'n'?
n+1 times
Просматривай карточки здесь или sign up to study with spaced repetition.
How many times is the 'printf' function executed in 'Test(n)'?
n times
Просматривай карточки здесь или sign up to study with spaced repetition.
If the time taken for 'printf' is one unit, what is the approximate time complexity of 'Test(n)'?
n units of time
Просматривай карточки здесь или sign up to study with spaced repetition.
What is the time complexity of the function 'Test(n)' in Big O notation?
O(n)
Просматривай карточки здесь или sign up to study with spaced repetition.
What is another name for a tracing tree?
Recursive tree
Просматривай карточки здесь или sign up to study with spaced repetition.
What is the next step after finding the time complexity using a tracing tree?
Prepare a recurrence relation for the function.
Просматривай карточки здесь или sign up to study with spaced repetition.
What is the typical function name used for recurrence relations?
t
Просматривай карточки здесь или sign up to study with spaced repetition.
What does 'n' stand for?
Represents a variable or an unspecified number.
Просматривай карточки здесь или sign up to study with spaced repetition.
What are the main topics covered in this video?
What is the basic structure of the C language function 'Test(n)'?
If n > 0, print n and call Test(n-1).
In the example, what is the output when 'Test(3)' is called?
3, 2, 1
How many times does 'Test(n)' call itself when given 'n'?
n+1 times
How many times is the 'printf' function executed in 'Test(n)'?
n times
If the time taken for 'printf' is one unit, what is the approximate time complexity of 'Test(n)'?
n units of time
What is the time complexity of the function 'Test(n)' in Big O notation?
O(n)
What is another name for a tracing tree?
Recursive tree
What is the next step after finding the time complexity using a tracing tree?
Prepare a recurrence relation for the function.
What is the typical function name used for recurrence relations?
t
What does 'n' stand for?
Represents a variable or an unspecified number.
Вы уверены, что хотите удалить 0 карточку(и)? Это невозможно будет отменить.
Выберите теги для удаления из 0 выбранные карточки:
Загрузка тегов...