amp-web-push-widget button.amp-subscribe { display: inline-flex; align-items: center; border-radius: 5px; border: 0; box-sizing: border-box; margin: 0; padding: 10px 15px; cursor: pointer; outline: none; font-size: 15px; font-weight: 500; background: #4A90E2; margin-top: 7px; color: white; box-shadow: 0 1px 1px 0 rgba(0, 0, 0, 0.5); -webkit-tap-highlight-color: rgba(0, 0, 0, 0); } .amp-logo amp-img{width:190px} .amp-menu input{display:none;}.amp-menu li.menu-item-has-children ul{display:none;}.amp-menu li{position:relative;display:block;}.amp-menu > li a{display:block;} /* Inline styles */ figure.acss427ab{max-width:377px;}figure.acss6ad73{max-width:487px;}figure.acss31018{max-width:399px;}figure.acss08583{max-width:363px;}figure.acss61950{max-width:380px;}div.acss138d7{clear:both;}div.acssf5b84{--relposth-columns:3;--relposth-columns_m:2;--relposth-columns_t:2;}div.acssd5df2{aspect-ratio:1/1;background:transparent url(https://code4coding.com/wp-content/uploads/2020/02/revstring.jpg) no-repeat scroll 0% 0%;height:150px;max-width:150px;}div.acss6bdea{color:#333333;font-family:Arial;font-size:12px;height:75px;}div.acsse8179{aspect-ratio:1/1;background:transparent url(https://code4coding.com/wp-content/uploads/2021/04/mirrired-rhombus-pat-java.jpg) no-repeat scroll 0% 0%;height:150px;max-width:150px;}div.acss7e482{aspect-ratio:1/1;background:transparent url(https://code4coding.com/wp-content/uploads/2020/03/salphabets.jpg) no-repeat scroll 0% 0%;height:150px;max-width:150px;}div.acssc61bb{aspect-ratio:1/1;background:transparent url(https://code4coding.com/wp-content/plugins/related-posts-thumbnails/img/default.png) no-repeat scroll 0% 0%;height:150px;max-width:150px;}a.acss9bfd5{font-size:14.52427184466pt;}a.acssc37f8{font-size:16.427184466019pt;}a.acss29e97{font-size:16.631067961165pt;}a.acss361c8{font-size:17.174757281553pt;}a.acss51c7b{font-size:20.029126213592pt;}a.acssa2e10{font-size:20.097087378641pt;}a.acss5dd67{font-size:21.728155339806pt;}a.acssf0e8e{font-size:12.077669902913pt;}a.acss759e3{font-size:17.922330097087pt;}a.acss0abf8{font-size:21.252427184466pt;}a.acss6bf84{font-size:13.504854368932pt;}a.acss349b0{font-size:10.038834951456pt;}a.acssf23c5{font-size:8pt;}a.acss7e0a8{font-size:9.2233009708738pt;}a.acsse6f77{font-size:16.970873786408pt;}a.acssc51bb{font-size:14.116504854369pt;}a.acss38f57{font-size:11.26213592233pt;}a.acss066f0{font-size:22pt;}a.acss4e811{font-size:17.31067961165pt;}a.acss9cc90{font-size:12.417475728155pt;}a.acss01721{font-size:15.339805825243pt;}a.acsse9f66{font-size:15.543689320388pt;}a.acss72254{font-size:20.708737864078pt;}a.acsseedeb{font-size:20.776699029126pt;}a.acss25b87{font-size:14.320388349515pt;}a.acss7c517{font-size:12.757281553398pt;}a.acss7a3ee{font-size:18.941747572816pt;}a.acssf92d5{font-size:18.26213592233pt;}a.acss551d3{font-size:16.291262135922pt;} .icon-widgets:before {content: "\e1bd";}.icon-search:before {content: "\e8b6";}.icon-shopping-cart:after {content: "\e8cc";}
In this tutorial, we will discuss the concept of the C code to Generate Pascal’s triangle using a 2 D array
In this topic, we are going to learn how to write a program to print Pascal triangle number patterns using a two dimension Array in the C programming language
Here, we use for, while, and do-while loops for printing pascal triangle
In this program, the user declares and initializes integer variables, it will display a pascal triangle number pattern using for loop in the C language according to the rows
Program 1
#include <stdio.h> #include <stdlib.h> int main() { int arr[50][50]; int i=0,j=0,num=0; printf("Enter the number o rows: "); scanf("%d",&num); for(i=0; i<num; i++){ for(j=0; j<num-1-i; ++j) printf(" "); for(j=0; j<=i; ++j){ if(j==0 || j==i) arr[i][j]=1; else arr[i][j]=arr[i-1][j-1]+arr[i-1][j]; printf("%d ", arr[i][j]); } printf("\n"); } getch(); return 0; }
When the above code is executed, it produces the following result
In this program, the user declares and initializes integer variables, it will display a pascal triangle number pattern using a while loop in the C language according to the rows
Program 1
#include <stdio.h> #include <stdlib.h> int main() { int arr[50][50]; int i=0,j=0,num=0; printf("Enter the number o rows: "); scanf("%d",&num); i=0; while(i<num){ j=0; while(j<num-1-i){ printf(" "); ++j; } j=0; while(j<=i){ if(j==0 || j==i) arr[i][j]=1; else arr[i][j]=arr[i-1][j-1]+arr[i-1][j]; printf("%d ", arr[i][j]); ++j; } printf("\n"); i++; } getch(); return 0; }
When the above code is executed, it produces the following result
In this program, the user declares and initializes integer variables, it will show a pascal triangle number pattern using a do-while loop in the C language according to the rows
Program 3
#include <stdio.h> #include <stdlib.h> int main() { int arr[50][50]; int i=0,j=0,num=0; printf("Enter the number o rows: "); scanf("%d",&num); i=0; do{ j=0; do{ printf(" "); ++j; }while(j<=num-1-i); j=0; do{ if(j==0 || j==i) arr[i][j]=1; else arr[i][j]=arr[i-1][j-1]+arr[i-1][j]; printf("%d ", arr[i][j]); ++j; }while(j<=i); printf("\n"); i++; }while(i<num); getch(); return 0; }
When the above code is executed, it produces the following result
Suggested for you
The operator in the C language
Similar post
Java program to print pascal triangle
C program to print pascal triangle
C++ program to print pascal triangle
Java program to print pascal triangle using an array
Java program to print pascal triangle using array using user input
C program to print a pascal triangle using an array
C program to print pascal triangle using array using user input
Java program to pascal triangle number pattern using 2 D array
10 best Ways to Subtract Two Numbers in Java (With Examples) In this article, we…
Array Data Structure: Definition, Types, Operations & Advantages Array Data Structure Introduction In this post,…
20 ways to subtract two numbers in Java In this article, we will discuss the…
10 simple ways to add two numbers in Java In this article, we will discuss…
Write a Python program to find the first n prime numbers In this article we…
Python: Calculate Average of odd and even in a list using loops In this post,…