Java/queue.java at main · Barnali722/Java · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
import java.util.*;
class queue
{
  int q[]=new int[5];
  int f,r,size;
  queue(int n)
  {
      for(int i=0;i<5;i++)
      {
          q[i]=0;
          f=-1;r=-1;
          size=n;
        }
    }
  void insertqueue(int item)
  {
      if(r==size-1)
      {
          System.out.print("Queue overflow");
        }
      else
      {
          if(f==-1&&r==-1)
          {
              f=0;
              r=0;
            }
            else
           r=r+1;
           q[r]=item;
        }
}
void deletequeue()
{
   if(f==-1&&r==-1)
   {
       System.out.print("Queue underflow :");
    }
    else
    {
        int val=q[f];
        if(f==r)
        {
            f=-1;
            r=-1;
        }
        else
        {
            f=f+1;
        }
    }
}
void display()
{
    if(f==-1&&r==-1)
    {
        System.out.println("Queue Underflows :");
    }
    else
    {
        System.out.println("Element of the queue :");
        for(int j=f;j<=r;j++)
        System.out.println(q[j]);
    }
}
}