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

3 votes169 views1 answer
How many ways we can do exception handling in java
Java
0 vote174 views1 answer
Trivers json node as node type
Java
1 vote179 views1 answer
Java convert a set to array
Java
0 vote206 views2 answers
Char array to arraylist java
Java
0 vote220 views1 answer
Betrag absolute abs java
Java
0 vote166 views1 answer
Java komplettes array ausgeben
Java
0 vote190 views1 answer
Thymeleaf Expression Object dialects
Java
0 vote185 views1 answer
Fibonacci of 6
Java
3 votes226 views2 answers
How to unistall java
Java
0 vote236 views1 answer
Spring security controlleradvice
Java Spring