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 vote208 views1 answer
Expression régulière téléphone java
Java
1 vote212 views1 answer
Convert date to calendar java
Java
-1 vote246 views1 answer
Why is java so verbose
Java
0 vote215 views1 answer
Handle customized popup in selenium
Java
1 vote216 views1 answer
Discord failed to install mac
Java
0 vote217 views2 answers
Hibernate onetone with mapsid
Java
0 vote225 views1 answer
Public static void trong java là gì
Java
0 vote236 views1 answer
How to clear a text file in java
Java
1 vote220 views1 answer
Java insert at index
Java
13 votes218 views2 answers
Java dictionary
Java