Algorithm

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/

안녕하세요

자료 보면서 공부하다가 counting sort 코드가 이상한 부분이 있어서 수정했습니다

1. 과정 3에서 누적합을 만들어줄 때 arr.length -> counting.length
2. 과정 4에서 다시 sorted_arr에 넣어줄 때 인덱스가 counting[arr[i]] -> counting[arr[i]] - 1

좋은자료 항상 감사합니다 :)

🚀 Feature Proposal

Adding leading zero in the question number will be an awesome feature for file explorer to sort files by the name.