If I had a function call itself, meaning it is recursive, would that factor into the time complexity of the function? Or if I had a function call another function, would that factor into the total complexity of the outside function? I did find some information about the recursive types of functions in CRLS, but I could not fully understand nor find about a function calling another function. What is the reasoning we should or should not as well?
Do we consider recursive method calls or other method calls inside a method for that method/function's time complexity?
73 Views Asked by Time_Barber9960 At
1
There are 1 best solutions below
Related Questions in ALGORITHM
- Two different numbers in an array which their sum equals to a given value
- Given two arrays of positive numbers, re-arrange them to form a resulting array, resulting array contains the elements in the same given sequence
- Time complexity of the algorithm?
- Find a MST in O(V+E) Time in a Graph
- Why k and l for LSH used for approximate nearest neighbours?
- How to count the number of ways of choosing of k equal substrings from a List L(the list of All Substrings)
- Issues with reversing the linkedlist
- Finding first non-repeating number in integer array
- Finding average of an array
- How to check for duplicates with less time in a list over 9000 elements by python
- How to pick a number based on probability?
- Insertion Sort help in javascript -- Khan Academy
- Developing a Checkers (Draughts) engine, how to begin?
- Can Bellman-Ford algorithm be used to find shorthest path on a graph with only positive edges?
- What is the function for the KMP Failure Algorithm?
Related Questions in LANGUAGE-AGNOSTIC
- What is a runtime environment for supposedly "no-overhead" systems languages?
- What do you call a thread's "ancestry"?
- What does it mean for a language to be open source?
- How to eliminate division inside code like "a/b>c/d"?
- Error reporting in a recursive descent parser
- How do I get tabs to copy properly in Netbeans?
- Statistical method to know when enough performance test iterations have been performed
- Greedy algorithm: highest value first vs earliest deadline first
- Algorithm: Best way to create solve this algorithm scenario
- Waiting for two subprocesses to finish but not necessarily waiting for first
- Dynamic programming and Dijkstra
- Complexity of Dijkstra shortest path
- Algorithm to calculate combinations without duplicates
- How do compilers detect usage of unassigned local variables?
- Algorithm to calculate permutations
Related Questions in TIME-COMPLEXITY
- Time complexity of the algorithm?
- Shell Vs. Hibbard time complexity comparison
- Time complexity of swapping elements in a python list
- constant time complexity: O(x^c)
- Java TreeMap time complexity - lowerKey
- Complexity of LSD string sort (cfr. Algorithms by Sedgewick & Wayne)
- How to search a unknown composite key for dictionary in O(1) in c#
- Confusion about why NP is contained in PSPACE, EXPTIME etc
- Depth first search or backtrack recursion for finding all possible combination of letters in a crossword puzzle/boggle board?
- Time complexity of nested for loops
- TIme complexity of various nested for loops
- Best case performance of quicksort (tilde notation)
- Ranking a given list of integers in less than O(n^2)
- Bellman-Ford algorithm proof of correctness
- Division of very large numbers
Related Questions in BIG-O
- Big-O insert for 2 dimensional array
- Compare growth of function
- Time complexity of nested for loops
- TIme complexity of various nested for loops
- Time complexity analysis for finding the maximum element
- Calculating the Recurrence Relation T(n)=T(n / log n) + Θ(1)
- Why is the cost of a hash lookup O(1) when evaluating the hash function might take more time than that?
- How can I tell how many times these nested statements will execute?
- Update minimum spanning tree if edge is added
- Have I properly sorted these runtimes in order of growth?
- find the complexity for loop
- Specific behaviour of {if else} in C
- What is the time complexity of the below function?
- Would this function be O(n^2log_2(n))?
- Complexity of a nested geometric sequence
Related Questions in CLRS
- What is the reason behind calculating GCD in Pollard rho integer factorisation?
- Heapsort algorithm CLRS
- Implementing a randomized quick sort algorithm
- Singly connected directed graphs
- Red Black Tree in C
- Operations on bits when doing binary long division
- Median select algorithm - does it find the absolute median, or a "median of medians" close to the absolute median?
- In Push Relabel algorithms for max flow why is there not path from source s to sink t?
- How to fix an UnboundLocalError caused due to a recursive function call in Python?
- understanding Universal hashing chapter on CLRS
- How to solve a problem on relative asymptotic growth (table) from CLRS?
- Why are not the way parameters/arguments passed considered for the time complexity of an algorithm?
- Does time complexity differ of the implementation of algorithms in different programming languages?
- Do we consider recursive method calls or other method calls inside a method for that method/function's time complexity?
- Average time complexity of open addressing
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
The call itself doesn't need to be considered to add any time, but calculations involving the parameters and the time needed to execute the function should.
Why? O-complexity doesn't care how you express a certain algorithmic idea. You could fully unroll your loops, use stacks or function calls - only the actual instructions matter. No cheating.