Pascal's triangle in java using recursion
// Pascal's triangle in java using recursion
import java.util.Scanner;
public class RecursionPascalTriangle
{
public static void display(int num)
{
for(int a = 0; a < num; a++)
{
for(int b = 0; b <= a; b++)
{
System.out.println(pascalTriangle(a, b) + " ");
}
System.out.println();
}
}
public static int pascalTriangle(int a, int b)
{
if(b == 0 || b == a)
{
return 1;
}
else
{
return pascalTriangle(a - 1, b - 1) + pascalTriangle(a - 1, b);
}
}
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
System.out.println("Please enter number of rows: ");
int row = sc.nextInt();
display(row);
sc.close();
}
}
Are there any code examples left?
New code examples in category Java
-
Java 2022-03-27 21:35:04 Sort string array in case insensitive order and case sensitive order java
-
Java 2022-03-27 21:25:10 java -jar -l resources\es.porperties -i ejemplo.txt -o inject.bin
-
Java 2022-03-27 21:20:21 Debug & Fix a 2-Dimensional Array Java Console Application
-
Java 2022-03-27 20:40:19 TreeSet headSet(E toElement) method in java
-
Java 2022-03-27 19:30:06 close keyboard android
-
Java 2022-03-27 19:20:40 java measure execution time
-
Java 2022-03-27 19:10:06 how to add cardview support in android studio
-
Java 2022-03-27 18:55:08 android studio lower case letters on a button