advance_java/CircularDQueueArray.java at master · daggerdaze/advance_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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
import java.util.*;
class CircularDQueueArray{
	static int r=-1;
	static int f=-1;
	static int queue[]=new int[5];
	public static void main(String[] args) {
		Scanner s= new Scanner(System.in);
		boolean b=true;
		while(b){
			System.out.println("enter the function to perform \n1:to insert in front\n2:to insert in back\n3:to delete in front \n4:to delete in back \n5:to print ");
		int z=s.nextInt();
			switch(z)
		{
			case 1:{
				int a=s.nextInt();
				Finsertion(queue,a);
				break;
			}
			case 2:{
				int c=s.nextInt();
				Rinsertion(queue,c);
				break;
			}
			case 3:{
				Fdeletion(queue);
				break;
			}
			case 4:{
				Rdeletion(queue);
				break;
			}
			case 5:{
				print(queue);
				break;
			}
			default:{
				System.out.println("GOOD BYE");
				b=false;
			break;
			}

		}
	}
	}
	static void Finsertion(int queue[],int a){
		if(overflow()){
			System.out.println("cant insert");
		}
		else{
			 if (f== -1){
            f= 0;
            r = 0;
        }
        else if (f== 0) {
            f= 4;
        }

        else{
                    f = f-1;
        queue[f] =a ;
		}
	}
}
	static void Rinsertion(int queue[],int c){
		if(overflow()){
			System.out.println("cant insert");
		}
		else{
			 if (f== -1){
            f= 0;
            r = 0;
        }
        else if (r==4) {
            r=0;
        }

        else{
                    r=r+1;
        queue[r] =c ;
		}
	}
	}
	static void Fdeletion(int queue[]){
		if(underflow()){
			System.out.println("cant delete");
		}
		else{
    if (f == r)
    {
        f= -1;
        r= -1;
    }
    else if (f== 4)
        f = 0;
    else
        f=f+1;

		}
	}
	static void Rdeletion(int queue[]){
		if(underflow()){
			System.out.println("cant delete");
		}
		else{
    if (f == r)
    {
        f= -1;
        r= -1;
    }
    else if (r==0)
        r=4;
    else
        r=r-1;

		}
	}
	static void print(int queue[]){
		if (f == -1)
    {
        System.out.println("Queue is Empty");
        return;
    }
    System.out.println("Elements in Circular DQueue are: ");
    if (r >= f)
    {
        for (int i = 0; i <= r; i++)
            System.out.println(queue[i]);
    }
	    else{
	        for (int i = f; i < 5; i++){
	            System.out.println( queue[i]);
	        }
	        for (int i = 0; i <= r; i++){
	            System.out.println( queue[i]);
	        }
	        for (int i = f; i <= r; i++){
	            System.out.println( queue[i]);
	        }
	    }
 		for (int i = 0; i <5; i++){
        	System.out.println( queue[i]);
		}
}
	static boolean overflow(){
		if ((f== 0 && r == 4) || (f==r+1)){
       		return true;
    	}
    else if(f==r+1){
        return true;
    }
    else{
    	return false;
    }
	}
	static boolean underflow(){

    if (f == -1) {
        return true;
    }

	else{
		return false;
	}
}

}