Pattern 1

Author: coder-mayank22

pattern_1.c

@@ -0,0 +1,17 @@
+#include<stdio.h>
+int n;
+
+int main(){
+    printf("Enter no. of rows : ");
+    scanf("%d",&n);
+    int i,j,c;
+    for(i=1;i<=n;i++){
+        c=n-i+1;
+        for(j=1;j<=i;j++)
+            printf("%d",c++);
+        for(int k=i+1;k<=n;k++)
+            printf("%d",n);
+        printf("\n");
+    }
+    return 0;
+}

pattern_1.exe

@@ -11,7 +11,7 @@ void swap(int *a, int *b){
 }
 
 int partition(int low, int high) {
-  
+  /*
   // select the rightmost element as pivot
   int pivot = a[high];
   
@@ -36,9 +36,33 @@ int partition(int low, int high) {
   swap(&a[i + 1], &a[high]);
   
   // return the partition point
-  return (i + 1);
-}
+  return (i + 1);*/
 
+  int i,j,t,flag=1,pos=low;
+  while(flag == 1){
+    for(i=high;i>pos;i--){
+        flag = 0;
+        if(a[pos]>a[i]){
+            swap(&a[pos], &a[i]);
+            pos=i;
+            flag=1;
+            break;
+        }
+    }
+    if(flag == 1){
+        for(i=low;i<pos;i++){
+            flag = 0;
+            if(a[pos]<a[i]){
+                swap(&a[pos],&a[i]);
+                pos = i;
+                flag = 1;
+                break;
+            }
+        }
+    }
+  }
+  return pos;
+}
 void Quicksort(int lb, int ub){
     if(lb<ub){
         pivot=partition(lb,ub);