currently, some of the programs use static type checking like this program but some of the programs did not use static typing.

it's a good practice to use static typing as it makes code more clear and readable, should we make it a standard for this repository.we can use mypy for

This is a(n):

• New algorithm
• Update to an existing algorithm
• Error
• Proposal to the Repository

Details:

We can make a file may be READ.

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

• Adding hints and doctest to old codes
• Reviewing Pending PRs
• Helping new Contributors
• Add more algorithms #14 #195

thank you

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.