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

10 votes186 views5 answers
Array average
Java
0 vote185 views1 answer
Spigot disable health regeneration
Java
0 vote211 views1 answer
Java program scan folder find files using time
Java
0 vote172 views1 answer
How to create java jframe in eclipse
Java
3 votes185 views4 answers
Java empty array
Java
0 vote251 views1 answer
Google pass api integration in java
Java
1 vote167 views1 answer
Java print statement
Java
0 vote208 views1 answer
How to add element to end of array java
Java
1 vote191 views1 answer
Java lombok constructor inject guice
Java
-3 votes172 views3 answers
Toast android
Java