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

A basic way of building up more complex vector graphics from simple primitives is to use clipping paths. Clipping, for instance, is quite natural in many classes of diagrams—for instance, imagine that you want to plot a collection of lines, curves, etc., but only within a certain rectangular region.

Here's a simple example of how clip paths work in SVG (from [this page](https://developer.mozil

There are multiple graph generators that currently do not check their input for validity.

These need to be fixed:

• callaway_traits_game
• establishment_game

The following functions have been verified to check their arguments properly:

forest_fire_game

Please update the lists above as you verify functions or find new ones with problems.

This is marked as

There is now a type circle in UniMath.SyntheticHomotopyTheory.Circle2. It would be great to define pi_1 of a pointed type, and to show that pi_1(circle, pt) \simeq Z.