In this chapter we discuss typical algorithms which have wide applicability, and derive their effi ciency or
complexity. The primary specifi cation measure will be the Order notation.
15.1 EXAMPLES FROM THE SORTING WORLD
Sorting provides a good set of examples for analyzing complexity. Simple sorting by repeatedly selecting the
minimum element from an array gives an upper bound of O(n
2
)for an n-element array. Here we look at other
methods for sorting to demonstrate that good algorithm design can improve this bound.
Remember that though a typical sorting application actually sorts records, data objects consisting of
several components or fi elds. For example, records representing people might have a combination ...
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.
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.
Julian F.
Head of Cybersecurity
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.
Addison B.
Field Engineer
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.
Amir M.
Data Platform Tech Lead
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.