Algorithms, data structures, and performance

This is an intermediate-level book, so you will probably know a lot about algorithms and data structures already, but we will nonetheless first provide some high-level overview for these topics before we discuss the Qt-specific use cases and gotchas. Let's start with algorithms.

Algorithm classes

Algorithms are recipes for calculating something. As you are an intermediate programmer, you might surely have heard about the O(n) (that is, the big O) notation which ranks the algorithms performance-wise. This notation describes the relative theoretical performance of algorithms by measuring how the runtime of an algorithm increases with increasing input size. The variable n stands...