added new files on 21-05-2021

Author: VedRatan

bestlogicpattern.cpp

@@ -0,0 +1,24 @@
+#include<stdio.h>
+#include<stdlib.h>
+int MAX(int a,int b)
+{
+	if(a>b)
+	return a;
+	else if(b>a)
+	return b;
+	else
+	return a; 
+}
+int main()
+{
+	printf("enter the number: ");
+	int n;
+	scanf("%d",&n);
+	int l=2*n-1;
+	for(int i=-n+1;i<n;i++)
+	{
+		for(int j=-n+1;j<n;j++)
+		printf("%d ",MAX(abs(i),abs(j))+1);
+		printf("\n");
+	}
+}

clone expansion.cpp

@@ -0,0 +1,85 @@
+#include<stdio.h>
+#include<stdlib.h>
+
+void print(int **s,int i,int columns,int degree)
+{
+    int j,x;
+    for(j=0;j<columns;j++)
+        {
+            x=0;
+            if(columns%2!=0)
+                if(j!=columns/2) {
+                    while(x<=degree) {
+                        printf("%d ",s[i][j]);
+                        x++; }
+                    }
+                else
+                    printf("%d ",s[i][j]);
+            else
+                {
+                    if(j==columns/2 || j==columns/2-1)
+                        printf("%d ",s[i][j]);
+                    else
+                        while(x<=degree) {
+                            printf("%d ",s[i][j]);
+                            x++; }
+                }
+
+        }
+}
+
+int main()
+{
+    int rows,columns,i,j,degree,y,**s;
+    printf("Enter rows and columns : ");
+    scanf("%d %d",&rows,&columns);
+    s=(int**)malloc(sizeof(int)*rows);
+    for(i=0;i<rows;i++)
+        s[i]=(int*)malloc(sizeof(int)*columns);
+    printf("Enter array :-\n");
+    for(i=0;i<rows;i++)
+        {
+            for(j=0;j<columns;j++)
+                scanf("%d",&s[i][j]);
+        }
+    printf("Enter expansion degree : ");
+    scanf("%d",&degree);
+    printf("\n");
+    for(i=0;i<rows;i++)
+        {
+            y=0;
+            if(rows%2!=0)
+                {
+                if(i!=rows/2)
+                while(y<=degree)
+                    {
+                        print(s,i,columns,degree);
+                        printf("\n");
+                        y++;
+                    }
+                else
+                    {
+                        print(s,i,columns,degree);
+                        printf("\n");
+                    }
+                }
+            else
+                {
+                    if(i==rows/2 || i==rows/2-1)
+                        {
+                            print(s,i,columns,degree);
+                            printf("\n");
+                        }
+                    else
+                        {
+                            while(y<=degree)
+                                {
+                                    print(s,i,columns,degree);
+                                    printf("\n");
+                                    y++;
+                                }
+                        }
+                }
+        }
+    return 0;
+}

reversing a number.cpp

@@ -0,0 +1,26 @@
+#include<stdio.h>
+#include<math.h>
+int main()
+{
+	int k=0;
+	int a=0,b=0,c=0,d=0,i=0;
+	printf("enter a number: \n");
+	scanf("%d",&a);
+	while(a>0)
+	{
+		if(i==0)
+		b=a%10;
+		else if(a<10)
+		c=a;
+		else
+		d=d*10+(a%10);
+		a=a/10;
+		i++;
+	}
+	for(int i=d;i>0;i/=10)
+	k=k*10+i%10;
+	k=k*10+c;
+	float x=b*pow(10,(i-1))+k;
+	printf("the number is: %f",x);
+}
+

stack implementation through arrays.cpp

@@ -0,0 +1,69 @@
+#include<stdio.h>
+#include<stdlib.h>
+struct stack
+{
+	int top;
+	int capacity;
+	int *a;
+};
+struct stack *newstack=(struct stack*)malloc(sizeof(struct stack));
+void push()
+{
+	int data;
+	if(newstack->top == newstack->capacity-1)
+	printf("overflow");
+	else
+	{
+		printf("enter the data: ");
+		scanf("%d",&data);
+		newstack->a[++newstack->top]=data;
+	}
+}
+void pop()
+{
+	if(newstack->top==-1)
+	printf("the stack is already empty");
+	else
+	{
+		newstack->a[newstack->top--];	
+	}
+}
+void display()
+{
+	if(newstack->top==-1)
+	printf("nothing to print");
+	else
+	{
+		for(int i=newstack->top;i>=0;i--)
+		printf("%d ",newstack->a[i]);
+	}
+}
+int main()
+{
+newstack->top=-1;
+newstack->a=(int*)malloc(newstack->capacity*sizeof(int));
+int capacity=100;
+newstack->capacity=capacity;
+	bool flag=true;
+	while(flag)
+	{
+		printf("----------------------------------------\n");
+		printf("enter 1 to push the element in stack \n enter 2 to pop the element from stack \n enter 3 to display the entire stack \n enter 4 to exit \n");	
+		printf("enter your choice: ");
+		int n;
+		scanf("%d",&n);
+		switch(n)
+		{
+			case 1: push();
+			break;
+			case 2: pop();
+			break;
+			case 3: display();
+			printf("\n");
+			break;
+			case 4: flag=false;
+			break;
+			default: printf("invalid choice");
+		}
+	}
+}

stackimplementation throughlinked list.cpp

@@ -0,0 +1,103 @@
+#include<stdio.h>
+#include<stdlib.h>
+struct node   
+{  
+int data;  
+struct node *link;  
+};  
+struct node *head=NULL;
+void push ()  
+{  
+    int data;  
+    struct node *temp =(struct node*)malloc(sizeof(struct node));   
+        printf("Enter the data: ");  
+        scanf("%d",&data);  
+        if(head==NULL)  
+        {         
+            temp->data = data;  
+            temp -> link = NULL;  
+            head=temp;  
+        }   
+        else   
+        {  
+            temp->data = data;  
+            temp->link = head;  
+            head=temp;  
+               
+        } 
+}
+void pop()  
+{  
+    int item;  
+    struct node *temp;  
+    if (head == NULL)  
+    {  
+        printf("Stack is already empty");  
+    }  
+    else  
+    {  
+        item = head->data;  
+        temp = head;  
+        head = head->link;  
+        free(temp);  
+        printf("data popped");  
+          
+    }  
+}  
+void show()  
+{    
+    struct node *temp;  
+    temp=head;  
+    if(temp == NULL)  
+    {  
+        printf("Stack is empty\n");  
+    }  
+    else  
+    {   
+      	 while(temp!=NULL)  
+        {  
+            printf("%d\n",temp->data);  
+            temp = temp->link;  
+        }  
+    }  
+}  
+int main ()  
+{          
+	bool flag=true;
+    while(flag != false)  
+    {  
+    	int n;
+		printf("\n----------------------------------------------");
+        printf("\nEneter 1 to push\nEnter 2 to pop\nEnter 3 to show the stack\nEnter 4 to Exit");  
+        printf("\n Enter your choice \n");        
+        scanf("%d",&n);  
+        switch(n)  
+        {  
+            case 1:  
+            {   
+                push();  
+                break;  
+            }  
+            case 2:  
+            {  
+                pop();  
+                break;  
+            }  
+            case 3:  
+            {  
+                show();  
+                break;  
+            }  
+            case 4:   
+            {  
+                printf("Exiting");
+				flag=false;  
+                break;   
+            }  
+            default:  
+            {  
+                printf("Invalid choice");  
+            }   
+    }
+}  
+}