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 884391
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 15, 20262026-05-15T12:44:34+00:00 2026-05-15T12:44:34+00:00

Please suggest me the solution to the following problem consider a function function recurse(a):

  • 0

Please suggest me the solution to the following problem

consider a function

function recurse(a):

  for child in a.childs:

      recurse(child)

Now I want to execute some code lets say

print "Program ends here"

when the program is done with recursion,so how can I know when the recursion will end?

Thank you

  • 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-15T12:44:34+00:00Added an answer on May 15, 2026 at 12:44 pm

    The various answers proposed so far, which sum up to “do it outside of recurse“, are fine. But if you’re keen to do it inside recurse, that’s not hard either (just marginally less efficient):

    function recurse(a, _toplevel=True):
      for child in a.childs:
          recurse(child, False)
      if _toplevel:
          print "Recursion done!"
    

    The leading _ in the name of the _toplevel argument indicates it’s private, so callers know not to pass it.

    Similar solutions involve keeping track of the level of recursion (not just whether it’s top level or not, but “how deep you are” in general):

    function recurse(a, _level=0):
      for child in a.childs:
          recurse(child, _level + 1)
      if _level == 0:
          print "Recursion done!"
    

    While precious in other cases (e.g. printing out nested structures with indents) it’s not needed here (and there’s another marginal loss of efficiency compared with the first solution I gave, based on the _toplevel boolean).

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

Sidebar

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.