What is BigO notation of f(n) = f(n/3) + f(n-5)? Can we just say f(n) = O(logn) + O(n) therefore O(n).

#### Linked Questions

- How to prove using big-O
- Need help figuring out whether this statement is correct
- What is the proper method to go about finding the order of growth for this function?
- What does "O(1) access time" mean?
- Big-O when the value of n gets very small?
- Whats the least upper bound of the growth rate using big-Oh notation of these two functions
- What is an easy way for finding C and N when proving the Big-Oh of an Algorithm?
- Calculating a Theta (Tight Bound) Estimation
- Program Runtime HW Problem
- What is the base of the logarithm for the purposes of Algorithms?
- What's my Big O?
- Big O Notation: differences between O(n^2) and O(n.log(n))?
- Hamiltonian circuit
- Algorithm analysis , Big O Notation Homework
- How do you determine the Big-O notation of a while loop?

#### Popular Questions

- Dynamic partition in hive
- Woocommerce Different Products Different Currency
- Rails render js file but can't execute it
- My rotated TextView is cut off. What i have to do?
- Store object created by gson in greenDao
- Clicking on array of images to add them to Konva stage
- How to sort a Google Charts DataTable or DataView using a function?
- 2 column layout looping through MVC model c#
- Integrating SVN with TFS
- Rails - after_initialize or initializer

## 1 Answers

#### Related Questions

- How to prove big-o relations
- Help Understanding Big O
- Big O and Little o
- Questions on runtime analysis properties
- tight (Θ) bound
- Big-oh time complexity for nested for loop
- What is big-O notation? How do you come up with figures like O(n)?
- Big O notation for triangular numbers?
- how to do big-O analysis when 2 algorithms are involved
- Problem from Growth of function
- Big O for code snippet
- Big-Oh Notation
- Big-Oh Notation problem
- Quick question about big-O notation
- Big O of pre order traversal, in order traversal ,post order, level order for tree

the difference between time complexity and Big-O is:

`time complexity`

is an exact value which tells use how much does a program take time to be executed.`Big-O`

is an estimation of the time complexity in main parts of the code.so, if you want the big-O you can say it's O(n) but if what you need is time complexity you should calculate a certain value.