Các flashcard này chưa được lưu — chúng sẽ biến mất khi bạn rời đi. Tạo tài khoản miễn phí để giữ lại và mở khóa mọi thứ bên dưới.
What are the main topics covered in this video?
Xem thẻ ở đây, hoặc 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).
Xem thẻ ở đây, hoặc sign up to study with spaced repetition.
In the example, what is the output when 'Test(3)' is called?
3, 2, 1
Xem thẻ ở đây, hoặc sign up to study with spaced repetition.
How many times does 'Test(n)' call itself when given 'n'?
n+1 times
Xem thẻ ở đây, hoặc sign up to study with spaced repetition.
How many times is the 'printf' function executed in 'Test(n)'?
n times
Xem thẻ ở đây, hoặc 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
Xem thẻ ở đây, hoặc sign up to study with spaced repetition.
What is the time complexity of the function 'Test(n)' in Big O notation?
O(n)
Xem thẻ ở đây, hoặc sign up to study with spaced repetition.
What is another name for a tracing tree?
Recursive tree
Xem thẻ ở đây, hoặc 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.
Xem thẻ ở đây, hoặc sign up to study with spaced repetition.
What is the typical function name used for recurrence relations?
t
Xem thẻ ở đây, hoặc sign up to study with spaced repetition.
What does 'n' stand for?
Represents a variable or an unspecified number.
Xem thẻ ở đây, hoặc 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.
Bạn có chắc chắn muốn xóa 0 flashcard? Hành động này không thể hoàn tác.
Chọn thẻ để gỡ khỏi 0 flashcard đã chọn:
Đang tải thẻ...