Hands-On Data Structures and Algorithms with Rust

Comparison

Having individual charts is great for imagining the projected runtime and estimating what a task's performance could look like when its input is increased. If we plot all of these lines into a single chart, however, their performance will become obvious.

The typical comparison is against the linear time complexity (O(n)), since most naive solutions would be expected to achieve this performance:

With this chart in mind, we can look at problems and their expected performance in the next section.