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

-1 vote336 views1 answer
Java runtime.getruntime().exec
Java
-1 vote304 views1 answer
How to generate color codes in java
Java
0 vote384 views1 answer
Spring mock Streamble of object
Java Spring
0 vote337 views1 answer
Spinner get items
Java
0 vote249 views1 answer
Lmethod java
Java
1 vote301 views1 answer
Java how to center window
Java
-3 votes323 views3 answers
Generic classes in java
Java
3 votes315 views1 answer
Minecraft chunk size
Java
4 votes330 views4 answers
Java while loop example
Java
4 votes319 views1 answer
Junit 5 assert exception message
Java