Let us not think that advances in the computer hardware technology will markedly change the situation
depicted in Table 14.1. Table 14.2 shows the expected effect of improved computer technology on running
times of various types of algorithms.
Algorithm
complexity
size of the largest problem solvable in 1 hr
With present
computer
With computer
100 times faster
With computer
1000 times
Poly nomial
n
n
2
n
3
n
5
N
1
N
3
N
4
N
5
100N
1
10N
2
4.64N
3
2.5N
4
1000N
1
31.6N
2
10N
3
3.98.N
4
Non-polynomial
2
n
3
n
N
5
N
6
N
5
+ 6.64
N
6
+ 4.19
N
5
+ 9.97
N
6
+ 6.29
Table 14.2Expected effect of improvements in computer technology on running times of algorithms
14.2 ...
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.