Chapter 13Searching and Sorting
A huge part of computer science involves studying how to organize, store, and retrieve data. There are many ways to organize and process data, and you need to develop an understanding of how to analyze how good an approach is. This chapter introduces you to some tools and concepts that you can use to tell whether a particular approach is faster or slower than another.
As you know, there are many solutions to each programming problem. If a problem involves a large amount of data, a slow algorithm will mean the problem can’t be solved in a reasonable amount of time, even with an incredibly powerful computer. This chapter includes several examples of both slower and faster algorithms. Try running them yourself; ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access