From: degski (degski_at_[hidden])
Date: 2020-02-26 21:18:45
On Wed, 26 Feb 2020 at 14:39, David Bellot via Boost <boost_at_[hidden]>
> Hi Boost community,
> so far we received a few good contributions for projects for GSoC 2020. The
> proposals are from our usual mentors but I'm surprised we don't have more
> projects in data structures and algorithms. Most of what we have concern
> numerical problems. It's great but I wish to see more diversity in the type
> of projects we propose.
Maybe the suggestions put forward do solicit few 'other' proposals. For
containers, f.e. there are many 'entertaining' and useful things to
consider, segment tree, spaghetti stack, trie, binary index tree, beap,
kd-tree, bkd-tree, disjoint-set, n-ary tree, etc etc, etc.
https://www.geeksforgeeks.org/advanced-data-structures/ presents many
different data structures, there also a section on algos.
-- @realdegski https://brave.com/google-gdpr-workaround/ "We value your privacy, click here!" Sod off! - degski "Anyone who believes that exponential growth can go on forever in a finite world is either a madman or an economist" - Kenneth E. Boulding "Growth for the sake of growth is the ideology of the cancer cell" - Edward P. Abbey
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk