Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 1076059
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 16, 20262026-05-16T21:21:29+00:00 2026-05-16T21:21:29+00:00

This recursive function uses over 1.4 MB of RAM, and it’s not freed. All

  • 0

This recursive function uses over 1.4 MB of RAM, and it’s not freed. All it returns is a single int. How can I free up much more memory?

function bottomUpTree($item, $depth)
{
   if ($depth)
   {
      --$depth;
      $newItem = $item << 1;
      return array(
         bottomUpTree($newItem - 1, $depth),
         bottomUpTree($newItem, $depth),
         $item
      );
   }
   unset($depth);
   unset($newItem);
   return array(NULL, NULL, $item);
}

bottomUpTree(0, 7);
  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-16T21:21:30+00:00Added an answer on May 16, 2026 at 9:21 pm

    Recursive functions will always suck up memory. Each call will use up a bit more until you reach the bottom and start returning. This is unavoidable. Doing unset() on the function’s parameters won’t help you… they’ve already taken up space on the call stack and can’t be removed until the function returns.

    One option would be to switch over to an iterative function, but that’s harder to do with a tree-structure.

    But most of all, what does this function actually accomplish? You’re returning arrays, but not assigning them anywhere in the calling level, so you’re creating a ton of arrays only to throw them away again immediately.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Please help me understand this recursive function... var stack = Array; function power(base, exponent){
I'm asking this because I'm working with a recursive function that generates a large
This function is much faster than its recursive version: crossSubstrings :: String -> String
I have this recursive method: public Hund getMor(int id) { Hund barn = getHund(id);
This code involves a recursive Stored Procedure call and a not so great method
I am writing a function called annotate that uses match-lambda -- often with recursive
This recursive function seems to work properly, adding to the result list the exact
I am writing this code that one function calls itself recursively. But I am
I was playing around with recursion and did this simple function. I was assuming
I often use this recursive 'visitor' in F# let rec visitor dir filter= seq

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.