Build priority queue

import java.util.Arrays;

public class PriorityQueue {
  private int[] items = new int[5];
  private int count;

  // O(n)
  public void add(int item) {
    if (isFull())
      throw new IllegalStateException();

    var i = shiftItemsToInsert(item);
    items[i] = item;
    count++;
  }

  public boolean isFull() {
    return count == items.length;
  }

  private int shiftItemsToInsert(int item) {
    int i;
    for (i = count - 1; i >= 0; i--) {
      if (items[i] > item)
        items[i + 1] = items[i];
      else
        break;
    }
    return i + 1;
  }

  // O(1)
  public int remove() {
    if (isEmpty())
      throw new IllegalStateException();

    return items[--count];
  }

  public boolean isEmpty() {
    return count == 0;
  }

  @Override
  public String toString() {
    return Arrays.toString(items);
  }
}

Similar codes

0 vote267 views1 answer
Before first method in jdbc
Java
2 votes300 views1 answer
Why are there no destructors in java?
Java
0 vote303 views1 answer
Get executable path java
Java
0 vote326 views1 answer
Unmarshalling in java
Java
1 vote310 views1 answer
Android highlight part of textview
Java
0 vote284 views1 answer
What is return method
Java
0 vote313 views1 answer
How to use double in insert data programming in java
Java
3 votes287 views3 answers
Rgb to hex java
Java
8 votes297 views3 answers
Java delay
Java
8 votes295 views10 answers
Print
Java