Parents : Recursion Time Complexity Space Complexity

Siblings :

Date and time note was created$= dv.current().file.ctime
Date and time note was modified$= dv.current().file.mtime

Time Complexity

  1. No. of function calls made during recursion.
  2. Time taken to execute a single function call.

Space Complexity

Recursion at its core uses stack to store the function calls

  • When any Function call is made, the function call gets pushed onto a Call Stack .
  • When the called function returns back to the calling function then the function call gets popped from the Call Stack.

References

Footnotes