Update PriorityQueues.java

hailK11 · web-flow · commit b73757e4bb0c · 2019-02-16T20:24:39.000+05:30
Include condition to check if the queue is full when inserting values into the queue
diff --git a/DataStructures/Queues/PriorityQueues.java b/DataStructures/Queues/PriorityQueues.java
@@ -37,6 +37,10 @@ public PriorityQueue(int size){
 	public void insert(int value){
 		if(nItems == 0){
 			queueArray[0] = value;
+			nItems++;
+		}
+		else if(isFull()){	//does not insert value when the queue is full
+			System.out.println("Queue is full");
 		}
 		else{
 			int j = nItems;
@@ -45,8 +49,8 @@ public void insert(int value){
 				j--;
 			}
 			queueArray[j] = value; //Once the correct position is found the value is inserted
+			nItems++;
 		}
-		nItems++;
 	}
 
 	/**
@@ -120,4 +124,4 @@ public static void main(String args[]){
 
 		//As you can see, a Priority Queue can be used as a sorting algotithm
 	}
-}
+}

Original file line number	Diff line number	Diff line change
`@@ -37,6 +37,10 @@ public PriorityQueue(int size){`
`37`	`37`	`public void insert(int value){`
`38`	`38`	`if(nItems == 0){`
`39`	`39`	`queueArray[0] = value;`
	`40`	`+ nItems++;`
	`41`	`+ }`
	`42`	`+ else if(isFull()){ //does not insert value when the queue is full`
	`43`	`+ System.out.println("Queue is full");`
`40`	`44`	`}`
`41`	`45`	`else{`
`42`	`46`	`int j = nItems;`
`@@ -45,8 +49,8 @@ public void insert(int value){`
`45`	`49`	`j--;`
`46`	`50`	`}`
`47`	`51`	`queueArray[j] = value; //Once the correct position is found the value is inserted`
	`52`	`+ nItems++;`
`48`	`53`	`}`
`49`		`- nItems++;`
`50`	`54`	`}`
`51`	`55`
`52`	`56`	`/**`
`@@ -120,4 +124,4 @@ public static void main(String args[]){`
`120`	`124`
`121`	`125`	`//As you can see, a Priority Queue can be used as a sorting algotithm`
`122`	`126`	`}`
`123`		`-}`
	`127`	`+}`