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

  • Home
  • SEARCH
  • 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 209463
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 11, 20262026-05-11T17:55:03+00:00 2026-05-11T17:55:03+00:00

The recursion is sort of a ‘divide and conquer’ style, it splits up while

  • 0

The recursion is sort of a ‘divide and conquer’ style, it splits up while getting smaller (Tree data structure), and I want it to break completely if a violation is found, meaning break all the recursive paths, and return true. Is this possible?

  • 1 1 Answer
  • 2 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-11T17:55:04+00:00Added an answer on May 11, 2026 at 5:55 pm

    You could return an error code, or modify some global variable so that each recursive instance knows to “kill itself”.

    Something of the sort.

    int foo(bar){
         int to_the_next;
    
          if (go_recursive){
                to_the_next = foo(whisky_bar);
    
                if (to_the_next ==DIE) return DIE;
          }
    
          if (something_unexpected_happened) return DIE;
    
          process;//may include some other recursive calls, etc etc
    }
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have to do a quick sort with recursion on a linked list.... So
Hi I am trying to implement Selection Sort in vb.net using recursion. Problem is
I recently learned about Recursive Common Table Expressions (CTEs) while looking for a way
I've adapted QuickSort Method to sort Array's Row. Here's the code: That one works
I was asked this question in an interview and I gave various solutions but
Command-line sftp in my Ubuntu doesn't have recursive put implemented. I found some debate
In 1987, I wrote the code I'm going to paste in a moment. The
I'm learning Scheme in a class and my professor doesn't answer questions after 8:00,
I'm taking an Algorithms class and the latest homework is really stumping me. Essentially,
I'm trying to find the most common list item common([b,a,a,a,c,d,b,f,s,f,s,f,s,f,s,f,f],R) so the result should

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.