How to resolve the algorithm Floyd's triangle step by step in the Groovy programming language

Published on 12 May 2024 09:40 PM

How to resolve the algorithm Floyd's triangle step by step in the Groovy programming language

Table of Contents

Problem Statement

Floyd's triangle   lists the natural numbers in a right triangle aligned to the left where

The first few lines of a Floyd triangle looks like this:

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Floyd's triangle step by step in the Groovy programming language

Source code in the groovy programming language

class Floyd {
    static void main(String[] args) {
        printTriangle(5)
        printTriangle(14)
    }

    private static void printTriangle(int n) {
        println(n + " rows:")
        int printMe = 1
        int numsPrinted = 0
        for (int rowNum = 1; rowNum <= n; printMe++) {
            int cols = (int) Math.ceil(Math.log10(n * (n - 1) / 2 + numsPrinted + 2))
            printf("%" + cols + "d ", printMe)
            if (++numsPrinted == rowNum) {
                println()
                rowNum++
                numsPrinted = 0
            }
        }
    }
}


  

You may also check:How to resolve the algorithm File modification time step by step in the FutureBasic programming language
You may also check:How to resolve the algorithm AKS test for primes step by step in the Scheme programming language
You may also check:How to resolve the algorithm Caesar cipher step by step in the zkl programming language
You may also check:How to resolve the algorithm Doubly-linked list/Element definition step by step in the Lang programming language
You may also check:How to resolve the algorithm Combinations with repetitions step by step in the REXX programming language