-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathREADME.txt
18 lines (14 loc) · 928 Bytes
/
README.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
Project: Polynomials
Authors: Francois BOSMA (bosma_f), Alexis YANG (yang_e)
Year: 2016
Please find below our comments on this project.
Polynomial : implementation choice :
- we chose to use variadic template to be able to easily implement with different containers
- we implemented an std::vector and a flat_map, we eventually lacked time to implement other implementations
- the variadic template was difficult to handle, and it took us quite some time to correct compilation errors
Bench :
- we compared both implementation and we can see that flat_map is better than vector
which is not a surprise.
Overall, we feel like we could have used an additional day to do a really good job. But even though our
bench is a bit light, we think we did a fairly good job and tried to use c++ standard and boost tools our best.
For example we wanted to use std::lower_bound using boost::bind, and eventually used a simple find.