I came across a new list data structure called GlueList that claims faster than classic list implementations.
How does it work ?
How can it be faster than ArrayList and LinkedList ?
1
$\begingroup$
$\endgroup$
-
2$\begingroup$ Well, what description to they give? Do you expect us to read the source code for you? Try for yourself and extract a conceptual/algorithmic description of their data structure. Then, try to analyse operation costs. Where and how do you get stucl? $\endgroup$ – Raphael♦ Nov 7 '15 at 11:04
