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 vote351 views1 answer
View get text android Close
Java
-3 votes411 views6 answers
Popcat
Java
0 vote363 views1 answer
Mint menu disapeared
Java
4 votes360 views1 answer
Random processing
Java
0 vote431 views1 answer
Region in android studio
Java
0 vote346 views1 answer
Java integer division tofloat
Java
0 vote355 views1 answer
Build.plugins.plugin.version
Java
0 vote361 views1 answer
How to set current item for spinner android
Java
0 vote354 views1 answer
Java replace all not number
Java
0 vote376 views1 answer
Public class App{ public static void main(string [] args){ System.out.println(" /|"); System.out.println(" / |"); System.out.println(" / |"); System.out.println("/___|");
Java