From b36640da0212ca28c203e351b29847199dda9f79 Mon Sep 17 00:00:00 2001
From: Anurag Mishra <115710545+17AnuragMishra@users.noreply.github.com>
Date: Sun, 22 Oct 2023 12:17:29 +0530
Subject: [PATCH] Merg it into c/c++ File

Best and most efficient way to code this pattern.
---
 pascaltrianglebestmethod.c | 18 ++++++++++++++++++
 special_pattern.c          | 21 +++++++++++++++++++++
 2 files changed, 39 insertions(+)
 create mode 100644 pascaltrianglebestmethod.c
 create mode 100644 special_pattern.c

diff --git a/pascaltrianglebestmethod.c b/pascaltrianglebestmethod.c
new file mode 100644
index 00000000..69ac0be6
--- /dev/null
+++ b/pascaltrianglebestmethod.c
@@ -0,0 +1,18 @@
+#include<stdio.h>
+int main(){
+    int n;
+    printf("enter the number: ");
+    scanf("%d", &n);
+    for(int i=0; i<=n; i++){
+        for(int k=1; k<=n-i;k++){
+            printf(" ");
+        }
+            int first =1;
+            for(int j=0; j<=i; j++){
+                printf("%d ", first);
+                first = first*(i-j)/(j+1);
+            }
+        printf("\n");
+    }
+    return 0;
+}
\ No newline at end of file
diff --git a/special_pattern.c b/special_pattern.c
new file mode 100644
index 00000000..66d0d4b0
--- /dev/null
+++ b/special_pattern.c
@@ -0,0 +1,21 @@
+#include<stdio.h>
+int main(){
+    int n;
+    printf("Enter the number: ");
+    scanf("%d", &n);
+    int min = 0;
+    for(int i=1;i<=2*n-1;i++){
+        for(int j=1;j<=2*n-1;j++){
+            int a = i;
+            if(i>n) a=2*n-i;
+            int b = j;
+            if(b>n) b = 2*n-j;
+            if(a<b) min = a;
+            else min =b;
+            printf("%d", n+1-min);
+        }
+        printf("\n");
+    }
+    return 0;
+
+}
\ No newline at end of file