As a first step, it is understandable that an algorithm would be fast for a small input data. For
example, the search for an item in a list of 10 elements would definitely be faster as compared to
searching the same item within a list of 1,000 elements. Therefore, the execution time T of an algo-
rithm has to be dependent upon N, the size of input data. Now the question is how to measure the
execution time T. Can we exactly compute the execution time? Perhaps not because there are many
factors that govern the actual execution of program in a computer system. Some of the important
factors are listed below:
nThe speed ...
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.