|
Boost : |
Subject: [boost] Segment Tree Implementation for GSoC 2014
From: Kevin Zuniga Garate (kevin.zun_at_[hidden])
Date: 2014-03-03 23:08:22
Hello everyone,
I'm Kevin and I'd like to contribute to Boost in this SoC.
I enjoy coding in C++ and participate a lot in competitive programming
sites such as TopCoder, Codeforces, etc.
A data structure I have learn from participating in those contests is
segment tree.
A segment tree is a data structure for storing data and querying and
updating it in intervals, I haven't found a segment tree library in C++, so
I thought it may be a good data structure for Boost.
Do you think that would be a good addition for Boost? If not, what other
data structure would you like to see implemented?
Greetings.
-- Kevin
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk