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 vote229 views1 answer
5:26 java: package javafx.application does not exist
Java
0 vote267 views1 answer
Problem solving using recursion in java
Java
0 vote225 views3 answers
Treeset in java
Java
0 vote255 views1 answer
Kotlin const to Java
Java
0 vote223 views1 answer
How to get start char in string in java
Java
1 vote244 views1 answer
Java search string in string
Java
3 votes226 views1 answer
Java get mouse position on screen
Java
1 vote271 views1 answer
Java Pair
Java
1 vote238 views1 answer
How to restart activity in android
Java
11 votes243 views2 answers
Java list to set
Java