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 vote385 views1 answer
Influx cli with docker container
Java
0 vote343 views1 answer
Calendar check if month is 30 days
Java
0 vote304 views1 answer
Parcourir string java
Java
0 vote383 views1 answer
How to secure specific url in spring security
Java Spring
0 vote296 views1 answer
Api for exchange rates
Java
0 vote339 views1 answer
How do you make bedrock full screen in Minecraft?
Java
0 vote328 views1 answer
How to check the current user in firebase android
Java
-1 vote319 views4 answers
Json array to List in java
Java
0 vote305 views1 answer
How to find root viewGroop
Java
0 vote324 views1 answer
Wsl-allow-port
Java