We have a lot of is_prime (or similar) functions: https://github.com/TheAlgorithms/Python/search?p=4&q=is_prime, https://github.com/TheAlgorithms/Python/search?q=isPrime, data_structures/hashing/number_theory/prime_numbers, etc. Shall we use one common function for that exactly identical

MinHeap and MaxHeap implementation are broken.
Instance of these heaps couldn't be instanciated with any not empty list of elements.

Here is a test code to reproduce:

@Test
void createFromList() {
    var elements = List.of(
            new HeapElement(5)
    );
    MaxHeap heap = new MaxHeap(elements);
    //similar with MinHeap
}

Stacktrace:

java.lang.IndexOut

You may use this guide to make quality contributions at Hacktoberfest 2020: Hacktoberfest 2020 guide

To begin contributing, you shall get a quick overview of how Cosmos is used today. Cosmos is one of the most extensive code database and is used as:

• A datastore for various projects (such as [Quark](https://github.com/OpenGenus/

steps to reproduce

Write a loop, from 1 to 80000, each time add a random int to the max heap.

In theory it takes very little time(NlogN, N=80000, <1sec ), but the program does take a long time.

I'v also tested the BinaryHeap in https://github.com/SolutionsDesign/Algorithmia, it performs well, so it is probably due to the bad algorithm.

• Suggestion (@lucblassel )
  In algorithms with variants, like Shell Sort, should have a way to the user select an variant to be visualized.
• How it could be implemented:
  Add a Input Box, like a drop list, in front of algorithm selection box.
• Are you up to do it?
  I @LucasPilla will be working on this, feel free to contribute!