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

Since we migrated from the Haskell runtime (what's in master now) to a React + Typescript runtime that's part of the frontend (what's in web-runtime now), a lot of the example domains we implemented for the paper need to be ported to the new runtime.

This is high-priority for us since it will enable us to test that the new runtime is at parity, and start c

Describe the bug

In the following reproducer, t.Scan() prints values for column out_x.out_x but the output is truncated to out_x.out, which can be quite confusing for larger trees with nested branches:

root [0] TTree t;
root [1] int x = 42;
root [2] t.Branch("out_x", &x)
(TBranch *) 0x5559ed5dc4f0
ro

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.