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 vote332 views1 answer
Kotlin edittext default value
Java
1 vote372 views1 answer
Install openjdk di linux
Java
0 vote324 views1 answer
Sysout shortcut sysout + Tab VS Code
Java
0 vote371 views1 answer
Java pattern check
Java
0 vote338 views1 answer
How to return array in java
Java
4 votes482 views1 answer
Spring load config value in variable
Java Spring
1 vote352 views2 answers
Compare two times in java
Java
0 vote337 views1 answer
Replace regex group() java
Java
0 vote323 views1 answer
Set preference value android
Java
0 vote351 views1 answer
How to get data from firebase notification in java
Java