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 vote156 views1 answer
Android list index
Java
0 vote256 views1 answer
Node-red-docker
Java
0 vote181 views2 answers
Android studio change title bar text
Java
0 vote252 views1 answer
Using ..replace() in jShell/java
Java
0 vote243 views2 answers
Material design implement full screen dialog android java
Java
2 votes297 views2 answers
Java singleton
Java
0 vote183 views1 answer
Navigation graph setup android
Java
1 vote218 views1 answer
Instance of non static inner class
Java
1 vote217 views1 answer
Jdbc driver servertimezone configuration property
Java
0 vote199 views2 answers
Calculate smallest angle difference
Java