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 vote123 views2 answers
Hackerearth test
Java
1 vote109 views1 answer
Validation dependency in spring boot
Java
0 vote100 views1 answer
Java print default options
Java
0 vote108 views1 answer
Refresh sharedpreferences going back java
Java
17 votes105 views3 answers
Public static void in java
Java
0 vote93 views2 answers
Android check file extension
Java
0 vote103 views1 answer
Printing array list through for loop in java
Java
2 votes133 views1 answer
How to iterate hashset in java 8
Java
1 vote90 views1 answer
Java jcombobox itemlistener only if value changed
Java
15 votes109 views2 answers
Ansi colors
Java