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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 23, 20262026-05-23T13:58:57+00:00 2026-05-23T13:58:57+00:00

public class Main { public static void pyr(int n) { for(int i=1;i<=n;i++) { for(int

  • 0
public class Main
{
    public static void pyr(int n)
    {      
        for(int i=1;i<=n;i++)
        {
             for(int j = 1;j<=i;j++)
             {  
                  System.out.print("*");
             }
             System.out.println();
        }
    }
 }

Can such a code for a pyramid like shape of asteriks be implemented recursively ? if so especially the 2 loops as the first one is for leveling while the second is used to fill each level.

  • 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-23T13:58:58+00:00Added an answer on May 23, 2026 at 1:58 pm

    The answer is yes – basically everything iterative can be done recursively, sometimes it is much easier, but more time consuming.

    For your question – this does the trick:

    public static void main(String[] args) 
    {
        printPyramid(7);
    }
    
    public static void printPyramid(int lines)
    {
        if (lines > 1)
        {
            printPyramid(lines-1);
        }
        printLine(lines);
        System.out.println("");
    }
    
    public static void printLine(int level)
    {
        if (level > 0)
        {
            System.out.print("*");
            printLine(level-1);
        }
    }
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

public class Main { public static void main(String[] args) { int[] x = {1,
Here is my code: public class Main { public static void main(String[] args) {
package hw3; public class Main { public static void main(String[] args) { final int
package javaapplication8; public class Main { public static void main(String[] args) { int[] list1
public class Main { static int x = Main.y; // static int x =
So far, I've tried the following: public class Widget { public int Id; public
Why doesn't this work? public class FooImpl implements Foo { /* ... */ }
I been trying to do the question title. Here is my current code: Main.java
i want to instantiate two TCP server applications within the same main method. Those
I am running into this problem when trying to recompile a single class inside

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.