Some compilers are able to generate effi cient implementations of a special type of recursive program
known as Tail Recursive. In this type of recursive function the recursive call is the last statement in the
function.
14.5 COMPLEXITY
This section discusses issues of program effi ciency, including how to measure and analyze programs for their
running time, as well as provide hints for improving program performance. We have already introduced this
topic in Chapter 4. Here we shall consider it formally and also in detail. In Chapter 5 we shall see examples
of complexity calculations related sorting and searching.
14.5.1 The Notion of Complexity
Computing for real-life problems, requires one to be aware of the ...
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.