The annual Hacktoberfest is around the corner! Register on Hacktoberfest's website and open 4 pull requests during October 2020 to receive the swags (if you're the first 70,000 participants)!

In our Python repository, there are currently several open issues:

• #1901
• #2128

What's more, you can al

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/

Add quickselect algorithm. Quickselect is a selection algorithm to find the kth smallest element in an unordered list.

doctest help

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.