This is not academic. What did reading this Master thesis teach me? That two approaches perform reasonably (by what standard?) with a size trade-off. That's an excellent start but also leaves open many questions: Why these two approaches? Are there reasons to expect they are better suited than other approaches in the literature? Were these results expected? Can I expect them to generalize? Do they paint a coherent picture on the performance of different designs in various contexts or are they surprising?
A lot of this is about generality of the knowledge gained. As a mere fact ("Two implementations of two algorithms that solve one problem perform slightly differently") it's not very interesting unless I have that exact specific problem myself. If I do, I would still need to find the paper. But if it is linked into a wider web of knowledge ("In paper [X] it was found that this algorithm performs well on tasks that have something in common with our problem, paper [Y] and [Z] suggest that we should expect a trade off for small sizes. Generally nothing is known about what should be algorithms well suited to the problem at hand.") it allows me to reason about situations.