This Pull Request is for HacktoberFest 2020

Description of Change

Checklist

• Added description

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

When changing AveragedPerceptron's default number of iterations from 1 to 10 in dotnet/machinelearning#5258, we missed one.

The main interface continues to default to 1 iteration:

Previous issues:

• dotnet/machinelearning#4749
• h

Tick-Tack-Toe game is not working for exception part

Description

Else part on line 247 takes you to infinite loop on getting any char value as input for position.

Expected Behavior

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.