ECONOMICS
COMPOUND INTEREST
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
interest rate
|
|
|
time
|
|
|
principal
|
|
|
total amount
|
Detailed explanation-1: -When we say that an algorithm runs in time T(n), we mean that T(n) is an upper bound on the running time that holds for all inputs of size n. This is called worst-case analysis. The algorithm may very well take less time on some inputs of size n, but it doesn’t matter.
Detailed explanation-2: -T(n), denoting the exact time needed to calculate the data of size n . It’s very useful when calculate the time needed of a recursive function.
Detailed explanation-3: -the time complexity equation is: T(n) = 2T(n-1) + C, taking C = 1 and T(1) = 1 .
Detailed explanation-4: -Linear Time: O(n) You get linear time complexity when the running time of an algorithm increases linearly with the size of the input. This means that when a function has an iteration that iterates over an input size of n, it is said to have a time complexity of order O(n).