Welcome!

By registering with us, you'll be able to discuss, share and private message with other members of our community.

SignUp Now!

recursion

  1. Velpus Captiosus

    Complicated recursive function help to find the output of a NN after n epochs of learning

    I think I have developed a algorithm to calculate the output of a NN after n epochs of learning ->this link:Expressing the output of a neural network after n iteration as a recursive function I have written some code: int input() { int x; printf("Give me the input:\n")...
  2. L

    JavaScript Recursively Delete objects from an array of nested objects

    Anyone know how to recursively find and delete an object from an array structured like this with infinite nested objects with the same structure? [ { id: 1, nest: [ { id: 2, nest: [{id: 3, nest: [{..continues..}]}], }, { id: 4, nest...
  3. G

    Python Doubt about recursion

    Hello, I have a doubt about how the following recursion works: ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ def fact(n): if n==1: return 1 else: return n*fact(n-1) print(fact(4)) ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ ’ The output is 24, which...
  4. T

    JavaScript Creating a new array from recursive mapping

    I am attempting to do something very complex. I have a database that has a self relation (categories that contain a nested category). The ORM I’m using makes use of these categories as objects: category = [ { name: "Lights", description: "some description", parentid: "some id"...
  5. J

    C++ How to recursively copy files and folders with files inside ?

    Hi guys. I want recursively copy files and folders with files inside. If folder do not exist, just create it. I just made this code: CStringArray strArray1; fnGetAllFilesNames(strArray1); CString slashs("\\")...
  6. B

    C++ Non tail recursive function help

    if i have a function f(n)=3+8+14+24+⋯+(n2−1) how do i implement this into a function recursively without using tail recursion? it needs a static variable used also thanks!
Back
Top Bottom