Merge pull request #867 from shellhub/master

make code less

DataStructures/Queues/PriorityQueues.java

@@ -42,19 +42,16 @@ class PriorityQueue {
     public void insert(int value) {
         if (isFull()) {
             throw new RuntimeException("Queue is full");
-        }
-        if (nItems == 0) {
-            queueArray[0] = value;
         } else {
-            int j = nItems;
+            int j = nItems - 1; // index of last element
-            while (j > 0 && queueArray[j - 1] > value) {
+            while (j >= 0 && queueArray[j] > value) {
-                queueArray[j] = queueArray[j - 1]; // Shifts every element up to make room for insertion
+                queueArray[j + 1] = queueArray[j]; // Shifts every element up to make room for insertion
                 j--;
             }
-            queueArray[j] = value; // Once the correct position is found the value is inserted
+            queueArray[j + 1] = value; // Once the correct position is found the value is inserted
-        }
             nItems++;
         } 
+    }
 
     /**
      * Remove the element from the front of the queue