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
Limits of Computation   ◾     301  
Figure10.4 contains a table that analyzes these counts in more detail.
is table shows the count of tickets that require examination for ticket
stacks of size 0, 10, 20, and 30 tickets. e bottom table row is a useful
generalization that shows the count based upon a variable (N) number of
tickets. In other words, given a stack of N tickets, no matter of the value of
N, the number of examinations will be either N or N/2.
Regardless of whether the stack contains the winning ticket, we con-
clude that the performance of this kind of search algorithm is directly pro-
portional to the number of tickets in the stack ...
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