In this chapter we shall discuss the characteristics of most of the common and real life algorithms, that is,
they have at least one iterative component or a loop. The iteration may be explicit through a looping construct
or it can be due to a recursive algorithm. In any case, the idea is that a part of the algorithm statements (or
code segments if it a program) will be executed repeatedly thousands or even millions of times. Even a
small amount of excess time spent within the loop can lead to a major loss in the effi ciency of the algorithm.
The situation can even be worse if there are loops within loops or nested iterations. There are algorithms
in which the depth of nesting itself is controlled ...
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.