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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 12, 20262026-05-12T15:14:05+00:00 2026-05-12T15:14:05+00:00

what would the recursive version for the following function would be like: void tri_loop(size_t

  • 0

what would the recursive version for the following function would be like:

void tri_loop(size_t i, size_t j, size_t k)
{
    for(size_t x = 0; x < i; ++x)
        for(size_t y = 0; y < j; ++y)
            for(size_t z = 0; z < k; ++z)
            {
                cout << x <<y << z;
            }
}

Just for mental drilling.(Edit: emphasized this line)

  • 1 1 Answer
  • 1 View
  • 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-12T15:14:05+00:00Added an answer on May 12, 2026 at 3:14 pm
    void recurse(accumulator,b,c,d,limit)
    {
      if (limit == 0)
        printf("%i %i %i\n", b, c, d);
      else
        if (accumulator<limit)
        {
          recurse(accumulator+1,b,c,d,limit);
          recurse(0,accumulator,b,c,d);
        }
    }
    
    main()
    {
      int x=2,y=3,z=4;
      recurse(0,0,x,y,z);
    }
    

    Is that recursive enough?

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

Sidebar

Related Questions

In clojure, I would like to write a tail-recursive function that memoizes its intermediate
This recursive function ( search_Bases ) would hopefully iterate through each base class and
I'm trying to write a recursive function that would get some string, as well
How do I construct functional and recursive datatypes in javascript? I would like to
Given an array, I would like a flattened version of the array keys. Each
I'm quiet new to bash scripting, and I would like to convert recursively all
Would like to parse IPv4 address from exit-addresses . Format of the file: ExitNode
Would it be possible to extract the following information from logs? Start up/Shut down
The following simple function applies a given monadic function iteratively until it hits a
I am trying to write a general function in F# that would return all

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.