#include <stdio.

h>
#include <stdlib.h>
/*
void main(){
int n='z',i;
for(i='a';i<=n;i++){
printf("%c",i);
}
======================================
int n=1,i;
while(n<101){
++n;
if (n%2==0){
printf("%d",n);
}
}
======================================
int n,sum=0,i;
scanf("%d",&n);
for (i=1;i<=n;i++){
sum+=i;
}
printf("%d",sum);
=======================================
int n,sum=0,i;
scanf("%d",&n);
for (i=1;i<=n;i++){
if (i%2==0){
sum+=i;
}
}
printf("%d",sum);
==============================================
int i=1,n;
scanf("%d",&n);
for (i=1;i<=n;i++){
printf("%d*%d=%d",n,i,n*i);
printf("\n");
}
==============================================
int r,n,c=0;
scanf("%d",&n);
while(n>0){
r=n%10;
n=n/10;
++c;
}
printf("%d",c);
======================================================
int r,n,p=1;
scanf("%d",&n);
while(n>0){
r=n%10;
p=p*r;
n/=10;
}
printf("%d",p);
======================================================
int r,n,rev;
scanf("%d",&n);
while(n>0){
r=n%10;
rev=rev*10+r;
n=n/10;
}
printf("%d",rev);
========================================================
int r,n,rev,temp;
scanf("%d",&n);
temp=n;
while(n>0){
r=n%10;
rev=rev*10+r;
n/=10;
}
if (temp==rev){
printf("Its palindrome");
}else{
printf("Not a palindrome");
}
==============================================================
int ch=0;
while(ch<=127){
printf("%d-%c\t",ch,ch);
++ch;
}
==============================================================
int p,n,ans=1,i;
scanf("%d,%d",&n,&p);
for(i=0;i<p;i++){
ans=ans*n;
}
printf("%d",ans);
=================================================================
int n,i=1;
scanf("%d",&n);
while(i<=n){
if(n%i==0){
printf("%d\t",i);
}++i;}
===========================================================
int n,i;
scanf("%d",&n);
for(i=1;i<=n;i++){
if(n%i==0){
printf("factors=%d\n",i);
}else{
printf("Not factor=%d\n",i);
}
}
===================================================================
int n,i,ans=1;
scanf("%d",&n);
for(i=1;i<=n;++i){
ans=ans*i;
}
printf("%d ",ans);
====================================================
#####DSA
int a=4,b=3;
int c;
printf("Before swap:%d %d\n",a,b);
a=a+b;
b=a-b;
a=a-b;
printf("After swap:%d %d",a,b);
===============================
int n,sum=0,r;
scanf("%d",&n);
while(n!=0){
r=n%10;
sum+=r;
n=n/10;
}
printf("%d",sum);
===============================
int r,n,rev,temp;
scanf("%d",&n);
temp=n;
while(n>0){
r=n%10;
rev=rev*10+r;
n/=10;
}
if (temp==rev){
printf("Its palindrome");
}else{
printf("Not a palindrome");
}
===============================
int r,n,sum=0,t;
scanf("%d",&n);
t=n;
while(n!=0){
r=n%10;
sum+=r*r*r;
n=n/10;
}
if(t==sum){
printf("Amstrong no");
}else{
printf("Not an amstrong");
}
==============================
int n,fact=1,i;
scanf("%d",&n);
for(i=1;i<=n;i++){
fact=fact*i;
}
printf("%d",fact);
==============================
int n,i,a=0,b=1,c=2,co;
scanf("%d",&n);
if(n<0){
printf("Enter positive values");
}else if(n==1){
printf("%d",a);
}else{
printf("%d",a);
printf("%d",b);
while(c<n){
co=a+b;
printf("%d",c);
c+=1;
a=b;
b=c;
}
}
==============================
int n,i,a[89];
printf("Enter the array size:");
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=0;i<n;i++){
printf("%d ",a[i]);
}
==============================
int r,c,i,j,a[23][32];
scanf("%d %d",&r,&c);
printf("Enter the elements:");
for(i=0;i<r;i++){
for(j=0;j<c;j++){
scanf("%d",&a[i][j]);
}
}
printf("Given matrix is :\n");
for(i=0;i<r;i++){
for(j=0;j<c;j++){
printf("%d ",a[i][j]);
}
printf("\n");
}

printf("Sparse matrix is:\n");

for(i=0;i<r;i++){
for(j=0;j<c;j++){
printf("%d ",a[j][i]);
}
printf("\n");
}
==============================
int j,n,i,a[89],pos,k; //INSERTION IN A GIVEN INDEX
printf("Enter array size:\n");
scanf("%d",&n);
printf("Enter elements:");
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
printf("Enter element to be inserted:\n");
scanf("%d",&k);
printf("Enter position:\n");
scanf("%d",&pos);
j=n;
n=n+1;
while(j>=pos){
a[j+1]=a[j];
j-=1;
}
a[pos]=k;
for(i=0;i<n;i++){
printf("%d ",a[i]);
}
==============================
int j,n,i,a[89],ind; //DELETION OF PARTICULAR ELEMENT
printf("Enter array size:\n");
scanf("%d",&n);
printf("Enter elements:");
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
printf("Enter the index:");
scanf("%d",&ind);
for(i=ind;i<n-1;i++){
a[i]=a[i+1];
}
n=n-1;
for(i=0;i<n;i++){
printf("%d ",a[i]);
}
==============================
int j,n,i,a[89],ind,k; //UPDATE OF PARTICULAR ELEMENT
printf("Enter array size:\n");
scanf("%d",&n);
printf("Enter elements:");
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
printf("Enter the index:");
scanf("%d",&ind);
printf("Enter element:");
scanf("%d",&k);
for(i=ind+1;i<n-1;i++){
a[ind]=k;
}
for(i=0;i<n;i++){
printf("%d ",a[i]);
}
==============================
int stack[100],i,n,choice=1,top=-1,x;
void push(void); //STACK USING ARRAYS
void pop(void);
void peak(void);
void display(void);
int main(){
printf("Enter the size:");
scanf("%d",&n);
while(choice!=5){
printf("\nChoose one from the below options:");
printf("\n1.Push\n2.pop\n3.peak\n4.display\n");
printf("\nEnter your choice:");
scanf("%d",&choice);
switch(choice){
case 1:push();
 break;
case 2:peak();
break;
case 3:pop();
break;
case 4:display();
break;

}
}
return 0;
}
void push(){
if(top==n-1){
printf("stack is overflow");
}else{
printf("Enter the value to be pushed:");
scanf("%d",&x);
top+=1;
stack[top]=x;
}
}
void pop(){
if(top==-1){
printf("\nstack is underflow");
}else{
printf("\npopped of the element is=%d",stack[top]);
top-=1;
}

}
void peak()
{
if(top==-1)
{
printf("\nstack is underflow");
}
else
{
printf("peak of the element is=%d",stack[top]);
}
}
void display(){
if(top>=0){
printf("\nthe elements in stack are:");
for(i=top;i>=0;i--){
printf("\n%d",stack[i]);
}
}

}
==============================
int stack[100],choice,top,n,i,x;
void push();
void pop();
void peek();
void display();
void main(){
top=-1;
 printf("Enter the size of stack:\n");
scanf("%d",&n);
printf("\t*****STACK OPERATIONGS USING ARRAYS*****\n");
printf("\n1.PUSH\n2.POP\n3.PEEK\n4.DISPLAY\n5.EXIT\n");
while(choice!=5){
printf("Enter your choice:\n");
scanf("%d",&choice);
switch(choice){
case 1:
push();
break;
case 2:
pop();
break;
case 3:
peek();
break;
case 4:
display();
break;
case 5:
printf("EXIT POINT\n");
break;
default:
{
printf("Enter valid choice.\n");
}
}
}
}
void push(){
if(top>=n-1){
printf("stack is overflow\n");
}else{
printf("Enter element to be inserted:\n");
scanf("%d",&x);
top++;
stack[top]=x;
}
}
void pop(){
if(top==-1){
printf("stack is underflow\n");

}else{
printf("popped element is:%d\n",stack[top]);
top--;
}
}
void peek(){
if(top==-1){
printf("stack is underflow\n");

}else{
printf("peek element is:%d\n",stack[top]);
}
}
void display(){
if(top>=0){
 for(int i=top;i>=0;i--){
printf("%d ",stack[i]);
}
}
}
========================================
struct node{
int data;
struct node *next;
}
*top=NULL;
void push(int);
void peek();
void pop();
void display();
void main(){
int choice,value;
printf("\n::Stack using linked list::\n");
while(1!=5){
printf("\n*****MENU*****\n");
printf("\n1.Push\n2.pop\n3.peak\n4.display\n");
printf("\nEnter your choice:");
scanf("%d",&choice);
switch(choice){
case 1:
printf("Enter the value to be inserted:");
scanf("%d",&value);
push(value);
break;
case 2:peek();
break;
case 3:pop();
break;
case 4:display();
break;
default:
printf("\nSelect only from given options");

}
}
}
void push(int value){
struct node *newnode;
newnode=(struct vode*)malloc(sizeof(struct node));
newnode->data=value;
if(top==NULL){
newnode->next=NULL;
}
else{
newnode->next=top;
top=newnode;
printf("Insertion is succesfull");
}
}
void peek(){
if(top==NULL){
printf("Stack is empty");
}else{
printf("Top of stack element=%d",top->data);
 }
}
void pop(){
struct node*temp;
temp=top;
if(top==NULL){
printf("Stack is empty");
}else{
printf("popped element=%d",top->value);
}
}
void display(){
struct node*temp;
temp=top;
if(top==NULL){
printf("Stack is empty");
}else{
while(temp!=NULL){
printf("value in stack=%d",temp->data);

}
}
}
====================================*/
int queue[100],i,n,choice,x,r=-1,f=-1; //QUEUE
void insert();
void Delete();
void display();
void main(){
int f=0,r=0;
printf("\t***MAIN MENU***\t\n");
printf("1.Insert\n2.Delete\n3.display\n4.Exit\n");
printf("Enter the size of queue:");
scanf("%d",&n);
while(choice!=4){
printf("Enter your choice:");
scanf("%d",&choice);
switch(choice){
case 1:insert();
break;
case 2:Delete();
break;
case 3:display();
break;
case 4:
printf("You are on Exit point");
default:
printf("Enter valid choice");
}
}
}
void insert(){
if(r==n-1){
printf("Queue is overflow");
}
else{
printf("Enter the value:");
scanf("%d",&x);
if(r==-1 && f==-1){
 f=0;
r=0;
}
r=r+1;
queue[r]=x;
}
}
void Delete(){
if(f==-1 || f>r){
printf("Queue is underflow");
}else{
x=queue[f];
}
if(f==r){
f=-1;
r=-1;
}else{
f=f+1;
printf("Deleted value:%d",x);
}
}
void display(){
if(r== -1)
{
printf("\nEmpty queue\n");
}
else
{ printf("\nprinting values:");
for(i=f;i<=r;i++)
{
printf("%d\t",queue[i]);
}
}
}
======================================================
#include <stdio.h>
#include <stdlib.h>
#define maxsize 5
/*int queue[maxsize],choice,front=-1,rear=-1;
void insert();
void delet();
void display();
void main(){
int x,i;
printf("***\tQUEUE USING ARRAYS***\t\n");
printf("1.PUSH\n2.DELETE\n3.DISPLAY\n4.EXIT\n");
while(choice!=4){ //QUEUE USING ARRAYS
printf("Enter your choice:\n");
scanf("%d",&choice);
switch(choice){
case 1:push();
break;
case 2:delet();
break;
case 3:display();
break;
default:printf("Enter correct choice.\n");
break;
}
 }
}
void push(){
int x;
printf("Enter the element:\n");
scanf("%d",&x);
if(rear==maxsize-1){
printf("Queue overflow\n");
}
if(front==-1 && rear==-1){
front=0;
rear=0;
}
else{
rear=rear+1;
}
queue[rear]=x;
}
void delet(){
int x;
if(front==-1 || front>rear){
printf("Queue underflow\n");
}
else{
x=queue[front];
if(front==rear){
front=-1;
rear=-1;
}else{
front=front+1;
}
printf("Deleted element:%d\n",x);
}
}
void display()
{
int i;
if(rear == -1)
{
printf("\nEmpty queue\n");
}
else
{ printf("\nprinting values:\n");
for(i=front;i<=rear;i++)
{
printf("%d ",queue[i]);
}
}}

========================================
void printdet(int n,int a[]){
for(int i=0;i<n;i++){
printf("%d ",a[i]); //BUBBLE SORT
}
}
void Bubblesort(int n,int a[]){
int t,isSorted=0;
for(int i=0;i<n-1;i++){
printf("\nworking on pass no:%d",i+1);
 isSorted=1;
for(int j=0;j<n-1-i;j++){
if(a[j]>a[j+1]){
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
isSorted=0;
}
}
if(isSorted){
return;
}
}
}
void main(){
int n=8;
int a[]={211,2,23,14,52,6,17,8};
printdet(n,a);
Bubblesort(n,a);
printf("\n");
printdet(n,a);
}
========================================
struct node{ //QUEUES USING ARRAYS
int data;
struct node *ptr;
};
struct node *front=NULL;
struct node *rear=NULL;
void enqueue(int);
void dequeue();
void display();
int main(){
int i,choice,value;
printf("***QUEUES USING ARRAYS***\n");
printf("1.ENQUEUE\n2.DEQUEUE\n3.DISPLAY\n");
while(choice!=4){
printf("Enter your choice:\n");
scanf("%d",&choice);
switch(choice){
case 1: printf("Enter the value to be insert:\n");
scanf("%d",&value);
enqueue(value);
break;
case 2: dequeue();
break;
case 3: display();
break;
case 4:exit(0);

}
}
}
void enqueue(int value){
struct node *newnode;
newnode=(struct node*)malloc(sizeof(struct node));
newnode->data=value;
newnode->ptr=NULL;
if(front==NULL){
 front=newnode;
rear=newnode;
}
else{
rear -> ptr = newnode;
rear = newnode;
rear->ptr=NULL;
}
printf("New node inserted\n");
}
void dequeue(int value){
if(front==NULL){
printf("Empty queue\n");
}else{
struct node*temp=front;
printf("Deleted element:%d\n",temp->data);
front=front->ptr;
free(temp);
}
}
void display(){
if(front==NULL){
printf("Empty queue..\n");
}else{
struct node*temp=front;
while(temp->ptr!=NULL){
printf("%d ",temp->data);
temp=temp->ptr;
}
printf("%d->NULL\n",temp->data);
}
}
========================================*/