queue ,stock and circular queue

-
#include<stdio.h>
#define sz 5
int rear=-1;
int front =-1;
int cqueue[sz];
int i;
void insert(int ele)
{
    if((front==rear+1)||(rear==sz))
    {
        printf("queue ids full\n");
    }else if(front==-1&&rear==-1)
    {
        front=rear=0;
        cqueue[rear]=ele;


    }
    else if(rear==sz-1)
    {       printf("ok");
        rear=0;
        cqueue[rear]=ele;
   
    }
    else
    {
        rear++;
        cqueue[rear]=ele;
    }
}
void delte()
{
    if(front==-1&&rear==-1)
    {
        printf("queue id empty\n");
    }
    else if (front==sz-1)
    {
        front=0;

    }
    else if(front ==rear)
    {
        front=rear=-1;
    }
        else
    {
       
        front++;
    }
}
void display()
{         printf("rear %d front %d \n",rear,front);
    for(i=0;i<=rear;i++)
    {
          printf("%d\t",cqueue[i]);
    }
//    for(i=front;i<sz;i++)
//    {
  //        printf("%d\t",cqueue[i]);

//    }
}
int main()
{
    insert(12);
    insert(12);
    insert(12);
    insert(12);
//    display();
    delte();
//    delte();
    insert(125);
    insert(126);
    insert(124);
    display();

}

 #include<stdio.h>
#define sz 5
int rear=-1;
int front =-1;
int cqueue[sz];
int i,k=4;
void insert(int ele)
{
    if((front==rear+1)||(rear==sz-1))
    {
        printf("queue ids full\n");
    }else if(rear== k)
    {       printf("ok");
        rear=0;
        cqueue[rear]=ele;
  
    }
    else
    {
        rear++;
        cqueue[rear]=ele;
    }
}

void display()
{         printf("rear %d front %d \n",rear,front);
    for(i=0;i<=rear;i++)
    {
          printf("%d\t",cqueue[i]);
    }
//    for(i=front;i<sz;i++)
//    {
  //        printf("%d\t",cqueue[i]);

//    }
}
int main()
{
    insert(12);
    insert(12);
    insert(12);
    insert(125);
    insert(126);
    insert(124);
    display();
}




#include<stdio.h>
#define sz 5
int rear=0;
int front=0;
int stack[sz];
int i;
void insert(int ele)
{
    if(rear==sz-1)
    {
        printf("stack is full\n");

    }
    else
    {
        stack[rear]=ele;
        printf("rear=%d\t stack ele %d\n",rear,stack[rear]);
        rear++;
    }
}
void delete()
{
    if(rear==front)
    {
        printf("stack is empty\n");
    }
    else
    {
        printf(" delte %d\n",stack[front]);

        for(i=0;i<rear-1;i++)
        {
                  stack[i]=stack[i+1];
        }
       
        rear--;
       
    }
}
void display()
{
    if(front==rear)
    {
        printf("stack is empty");
    }
    for(i=front;i<rear;i++)
    {
        printf("%di\t",stack[i]);
    }
}
int main()
{
insert(123);
insert(12);
insert(13);
insert(23);
display();
delete();
delete();
delete();
display();
//printf("%d %d\n",stack[0],stack[1]);
}

Comments

Post a Comment

Popular posts from this blog

circular linked list

-
                    circular linked list           method one  #include<stdio.h> #include<stdlib.h> struct node {         int data;         struct node *next; }*start=NULL; enum op{INSERT=1,DELETE,TRAVERSE,EXIT}; enum op1{BEG=1,POS,END}; int count =1; void insert_beg(int data) {         struct node *newnode = (struct node *)malloc(sizeof(struct node));         newnode->data = data;         newnode->next = NULL;         if(start == NULL)         {                 start = newnode;   start->next = start;         }  ...
Read more

calendar program odd days method

-
                                     calendar program odd days method           first visit code first fall understand odd method please flow my simple example              Remember  this two logics months odd code and year odd code year code  code                  days                                                                0 odd days for  0                      Sunday                                               ...
Read more

C in Depth

-
/*P2.1 Program to find out the size and limits of data types*/ #include<stdio.h> #include<limits.h> #include<float.h> int main(void) { printf("sizeof(char) = %u\n",sizeof(char)); printf("sizeof(short) = %u\n",sizeof(short)); printf("sizeof(int) = %u\n",sizeof(int)); printf("sizeof(long) = %u\n",sizeof(long)); printf("sizeof(float) = %u\n",sizeof(float)); printf("sizeof(double) = %u\n",sizeof(double)); printf("sizeof(long double) = %u\n",sizeof(long double)); printf("SCHAR_MIN = %d\n",SCHAR_MIN); printf("SCHAR_MAX = %d\n",SCHAR_MAX); printf("UCHAR_MAX = %d\n",UCHAR_MAX); printf("SHRT_MIN = %d\n",SHRT_MIN); printf("SHRT_MAX = %d\n",SHRT_MAX); printf("USHRT_MAX = %u\n",USHRT_MAX); printf("INT_MIN = %d\n",INT_MIN); printf("INT_MAX = %d\n",INT_MAX); printf("UINT_MAX = %u\n...
Read more