Skip to Main Content
Computational Thinking for the Modern Problem Solver
book

Computational Thinking for the Modern Problem Solver

by David Riley, Kenny A. Hunt
March 2014
Beginner to intermediate content levelBeginner to intermediate
405 pages
12h 16m
English
Chapman and Hall/CRC
Content preview from Computational Thinking for the Modern Problem Solver
306   ◾     Computational Thinking for the Modern Problem Solver
Some algorithms have execution times that grow much faster than
polynomial algorithms. As an example consider the operation of a com-
bination padlock such as that pictured in Figure10.11. Now suppose that
you have forgotten your combination to such a padlock.
One algorithm for recovering the forgotten combination is to attempt
all possible combinations until the correct one is discovered. What we
know about padlocks of this type is that a combination generally consists
of rotating the dial clockwise to one integer marking, then counterclock-
wise past and to a second integer ma ...
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.
Start your free trial

You might also like

From Computing to Computational Thinking

From Computing to Computational Thinking

Paul S. Wang

Publisher Resources

ISBN: 9781466587793