Priority Queue Test Algorithm

The Priority Queue Test Algorithm is a fundamental algorithm used to evaluate and validate the performance and functionality of a priority queue data structure. A priority queue is a specialized queue data structure where each element is assigned a priority and elements with higher priorities are processed before lower priority elements. The primary operations of a priority queue are insertion, deletion, and retrieval of the highest-priority element. The Priority Queue Test Algorithm checks these operations to ensure that the priority queue behaves as expected. In the Priority Queue Test Algorithm, a series of operations are performed on a priority queue to test its correctness and efficiency. These operations typically include inserting a number of elements along with their priorities, removing elements with the highest priority, and checking the highest-priority element without removing it. These operations are performed in a specific sequence to ensure that the priority queue maintains the correct ordering of elements based on their priorities and adheres to the expected time complexities for each operation. The algorithm may also be used to compare the performance of different priority queue implementations or to identify potential bottlenecks and inefficiencies in a given implementation. 
/*
 * Copyright (c) 2017 Kotlin Algorithm Club
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in all
 * copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 */
 
package com.algorithmexamples.datastructures
 
import org.junit.Assert
import org.junit.Test
import java.util.NoSuchElementException
 
class PriorityQueueTest {
    @Test
    fun emptyTest() {
        val pq = PriorityQueue<Int>(3)
        Assert.assertEquals(0, pq.size)
        Assert.assertTrue(pq.isEmpty())
    }
 
    @Test(expected= NoSuchElementException::class)
    fun exceptionTest() {
        val pq = PriorityQueue<Int>(3)
        pq.peek()
    }
 
    @Test
    fun naiveTest() {
        val pq = PriorityQueue<Int>(3)
        for (i in 10 downTo 1) {
            pq.add(i)
            Assert.assertEquals(i, pq.peek())
        }
        for (i in 1..10) {
            Assert.assertEquals(i, pq.poll())
        }
    }
}

LANGUAGE:

DARK MODE:

PROGRAMMING LANGUAGES:

Python

Java

Javascript

C#

C++

C

Ruby

Scala

MATLAB

Kotlin

Rust

R

Go